DeepAI AI Chat
Log In Sign Up

A collection of memos dedicated to exact base-21 (EBTO) and quasi base-21 (QBTO) codes

03/13/2023
by   Alexander Ivanov, et al.
0

This collection bundles the following memos dedicated to the so called exact base-21 (EBTO) and quasi base-21 (QBTO) serial transport codes: [1] "Base-21 Scrambling" (discusses about EBTO codes, present at pp. 1-4 in the bundle); [2] "Base-21 Word Alignment and Boundary Detection" (EBTO, pp. 5-8); [3] "Quasi Base-21 Words" (QBTO, pp. 9-12); [4] "Quasi Base-21 Words Generated Compactly" (QBTO, pp. 13-16); and [5] "Quasi Base-21 Words Balanced on the Framework" (QBTO, pp. 17-20).

READ FULL TEXT
03/09/2019

Construction of Isodual Quasi-cyclic Codes over Finite Fields

This paper considers the construction of isodual quasi-cyclic codes. Fir...
12/19/2019

On the algebraic structure of quasi group codes

In this note, an intrinsic description of some families of linear codes ...
06/05/2022

A Quasi-Uniform Approach to Characterizing the Boundary of the Almost Entropic Region

The convex closure of entropy vectors for quasi-uniform random vectors i...
08/04/2021

On origami-like quasi-mechanisms with an antiprismatic skeleton

We study snapping and shaky polyhedra which consist of antiprismatic ske...
06/03/2019

Encryption Scheme Based on Expanded Reed-Solomon Codes

We present a code-based public-key cryptosystem, in which we use Reed-So...
12/05/2017

Optimal Quasi-Gray Codes: Does the Alphabet Matter?

A quasi-Gray code of dimension n and length ℓ over an alphabet Σ is a se...
12/18/2018

Frank-Wolfe Algorithm for the Exact Sparse Problem

In this paper, we study the properties of the Frank-Wolfe algorithm to s...