Skip to main content
Erschienen in: Designs, Codes and Cryptography 1/2016

01.07.2016

New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds

verfasst von: Eric Zhi Chen

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2016

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

An [\(n, k, d\)] code is a binary linear code of block length \(n\), dimension \(k\) and minimum Hamming distance \(d\). Since the minimum distance determines the error detection or correction capability, it is desired that \(d\) is as large as possible for the given block length \(n\) and dimension \(k\). One of the most fundamental problems in coding theory is to construct codes with best possible minimum distances. This problem is very difficult in both theory and practice. During the last decades, it has proved that the class of quasi-cyclic (QC) codes contain many such codes. In this paper, augmentation of binary QC codes is studied. A new augmentation algorithm is presented, and 10 new \(h\)-generator QC codes that are better than previously known code have been constructed. Furthermore, Construction X has been applied to obtain another 18 new improved binary linear codes. With the standard construction techniques, a total of 124 new binary linear codes that improve the lower bound on the minimum distance have been obtained.
Literatur
1.
Zurück zum Zitat Aydin N., Siap I.: New quasi-cyclic codes over F\(_{5}\). Appl. Math. Lett. 15, 833–836 (2002). Aydin N., Siap I.: New quasi-cyclic codes over F\(_{5}\). Appl. Math. Lett. 15, 833–836 (2002).
2.
Zurück zum Zitat Aydin N., Siap I., Ray-Chaudhuri D.K.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 24, 313–326 (2001). Aydin N., Siap I., Ray-Chaudhuri D.K.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 24, 313–326 (2001).
3.
Zurück zum Zitat Bosma W., Cannon J., Playoust C.: The Magma algebra system I: the user language. J. Symb. Comput. 24, 235–265 (1997). Bosma W., Cannon J., Playoust C.: The Magma algebra system I: the user language. J. Symb. Comput. 24, 235–265 (1997).
4.
Zurück zum Zitat Chen E.Z.: Six new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 40, 1666–1667 (1994). Chen E.Z.: Six new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 40, 1666–1667 (1994).
5.
Zurück zum Zitat Chen E.Z.: New quasi-cyclic codes from simplex codes. IEEE Trans. Inf. Theory 53, 1193–1196 (2007). Chen E.Z.: New quasi-cyclic codes from simplex codes. IEEE Trans. Inf. Theory 53, 1193–1196 (2007).
8.
Zurück zum Zitat Chen C.L., Peterson W.W.: Some results on quasi-cyclic codes. Inf. Contr. 15, 407–423 (1969). Chen C.L., Peterson W.W.: Some results on quasi-cyclic codes. Inf. Contr. 15, 407–423 (1969).
9.
Zurück zum Zitat Daskalov R.N., Gulliver T.A., Metodieva E.: New good quasi-cyclic ternary and quaternary linear codes. IEEE Trans. Inf. Theory 43, 1647–1650 (1997). Daskalov R.N., Gulliver T.A., Metodieva E.: New good quasi-cyclic ternary and quaternary linear codes. IEEE Trans. Inf. Theory 43, 1647–1650 (1997).
10.
Zurück zum Zitat Daskalov R., Hristov P.: New quasi-twisted degenerate ternary linear codes. IEEE Trans. Inf. Theory 49, 2259–2263 (2003). Daskalov R., Hristov P.: New quasi-twisted degenerate ternary linear codes. IEEE Trans. Inf. Theory 49, 2259–2263 (2003).
12.
Zurück zum Zitat Gulliver T.A., Bhargava V.K.: Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes. IEEE Trans. Inf. Theory 37, 552–555 (1991). Gulliver T.A., Bhargava V.K.: Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes. IEEE Trans. Inf. Theory 37, 552–555 (1991).
13.
Zurück zum Zitat Gulliver T.A., Bhargava V.K.: Nine good (m-1)/pm quasi-cyclic codes. IEEE Trans. Inf. Theory 38, 1366–1369 (1992). Gulliver T.A., Bhargava V.K.: Nine good (m-1)/pm quasi-cyclic codes. IEEE Trans. Inf. Theory 38, 1366–1369 (1992).
14.
Zurück zum Zitat Gulliver T.A., Östergård P.R.J.: New binary linear codes. Ars Comb. 56, 105–112 (2000). Gulliver T.A., Östergård P.R.J.: New binary linear codes. Ars Comb. 56, 105–112 (2000).
15.
Zurück zum Zitat Heijnen P., vanTiborg H.C.A., Verhoeff T., Weijs S.: Some new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 44, 1994–1996 (1998). Heijnen P., vanTiborg H.C.A., Verhoeff T., Weijs S.: Some new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 44, 1994–1996 (1998).
16.
Zurück zum Zitat Siap I., Aydin N., Ray-Chaudhuri D.K.: New ternary quasi-cyclic codes with better minimum distances. IEEE Trans. Inf. Theory 46, 1554–1558 (2000). Siap I., Aydin N., Ray-Chaudhuri D.K.: New ternary quasi-cyclic codes with better minimum distances. IEEE Trans. Inf. Theory 46, 1554–1558 (2000).
17.
Zurück zum Zitat Siguin G.E.D.: The theory of l-generator quasi-cyclic codes. Unpublished manuscript (1990). Siguin G.E.D.: The theory of l-generator quasi-cyclic codes. Unpublished manuscript (1990).
18.
Zurück zum Zitat Van Tilborg H.C.A.: On quasi-cyclic codes with rate 1/m. IEEE Trans. Inf. Theory 24, 628–629 (1978). Van Tilborg H.C.A.: On quasi-cyclic codes with rate 1/m. IEEE Trans. Inf. Theory 24, 628–629 (1978).
Metadaten
Titel
New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
verfasst von
Eric Zhi Chen
Publikationsdatum
01.07.2016
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 1/2016
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-015-0059-5

Weitere Artikel der Ausgabe 1/2016

Designs, Codes and Cryptography 1/2016 Zur Ausgabe