Bibliographische Detailangaben
| Titel: |
Embedding Linear Codes Into Self-Orthogonal Codes and Their Optimal Minimum Distances. |
| Autoren: |
Kim, Jon-Lark, Kim, Young-Hun, Lee, Nari |
| Quelle: |
IEEE Transactions on Information Theory; Jun2021, Vol. 67 Issue 6, p3701-3707, 7p |
| Schlagwörter: |
BINARY codes, LINEAR codes, HAMMING distance, MAXIMA & minima, DISTANCES, QUANTUM computing |
| Abstract: |
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an algorithmic method to embed a given binary k-dimensional linear code C (k = 3,4) into a self-orthogonal code of the shortest length which has the same dimension k and minimum distance d' ≥ d(C). For k > 4, we suggest a recursive method to embed a k -dimensional linear code to a self-orthogonal code. We also give new explicit formulas for the minimum distances of optimal self-orthogonal codes for any length n with dimension 4 and any length n ≢ 6, 13,14,21,22,28,29 (mod 31) with dimension 5. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Datenbank: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science