The optimality of one class of fragment-cyclic codes
Abstract
A binary situation is described in terms of a quasi-cyclic code, if the cycle shift of a given code word leads to that word. The generated matrix in the linear case is presented by using the appropriate permutation of lines and columns. It is found that the codes of this class emerge on the Varshamov-Hilbert boundary.
- Publication:
-
Increasing the Accuracy of Transmission of Digital Inform. on Discrete Channels
- Pub Date:
- 1974
- Bibcode:
- 1974iatd.rept...18G
- Keywords:
-
- Binary Codes;
- Digital Systems;
- Optimal Control;
- Data Transmission;
- Hilbert Space;
- Linear Transformations;
- Matrices (Mathematics);
- Orthogonality;
- Communications and Radar