Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

New results on binary quasi-cyclic codes

Zhi Chen

Published Nov 7, 2002• 4 citations
Publisher

Abstract

Twelve new binary quasi-cyclic codes, which improve the lower bounds on minimum distances for binary linear codes, are presented, and a Web database on best-known binary quasi-cyclic codes is constructed for public access.
DOI
10.1109/isit.2000.866495

Related papers

On quasi-cyclic codes

P. Heijnen, Henk van Tilborg, S. Weijs

Many binary quasi-cyclic codes have a better minimum distance than other known linear codes with the same parameters. We present 43 new quasi-cyclic codes, which improve on the parameters of previously found quasi-cyclic codes. Five of them even improve the lower bound on the minimum distance for linear codes. Furthermore we present a decoding algorithm for the binary quasi-cyclic codes of rate 1/m.

IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•6 citations

New binary linear codes

Thomas Aaron Gulliver, Patric R. J. Östergård

In this paper, nineteen new binary linear codes are presented which improve the bounds on the maximum possible minimum distance. These codes belong to the class of quasi-cyclic (QC) codes, and have been constructed using a stochastic optimization algorithm, tabu search. Six of the new codes meet the upper bound on minimum distance and so are optimal.

Ars Combinatoria•Jan 1, 2000•10 citations

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

Eric Zhi Chen

Designs Codes and Cryptography•Mar 14, 2015•10 citations

New distance bounds for quasi-cyclic codes

Özkaya, Buket, Özbudak, Ferruh

•Jul 1, 2024•0 citations

Some new binary codes with improved minimum distances

Eric Z. Chen

It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this paper, a method to conduct a computer search for binary $2$-generator QC codes is presented, and a large number of good $2$-generator QC codes have been obtained. $5$ new binary QC codes that improve the lower bounds on minimum distance are presented. Furthermore, with new $2$-generator QC codes and Construction X, $2$ new improved binary linear codes are obtained. With the standard construction techniques, another $16$ new binary linear codes that improve the lower bound on the minimum distance have also been obtained. Received: 9 November 2016 Accepted: 22 November 2017

Journal of Algebra Combinatorics Discrete Structures and Applications•Mar 13, 2018•6 citations

New Binary Quantum Codes Derived From One-Generator Quasi-Cyclic Codes

Jingjie Lv, Ruihu Li, Junli Wang

In this paper, we consider a family of one-generator quasi-cyclic (QC) codes and their applications in quantum codes construction. We give a sufficient condition for one-generator QC codes to be self-orthogonal with respect to the symplectic inner product. As the computational results, five new binary quantum codes with parameters [[45,29,5]], [[63,36,7]], [[73,55,5]], [[105,71,7]], and [[105,72,7]] improving the best-known lower bounds on minimum distance in Grassl's code tables are constructed.

IEEE Access•Jan 1, 2019•29 citations
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this paper, a method to conduct a computer search for binary 222-generator QC codes is presented, and a large number of good 222-generator QC codes have been obtained. 555 new binary QC codes that improve the lower bounds on minimum distance are presented. Furthermore, with new 222-generator QC codes and Construction X, 222 new improved binary linear codes are obtained. With the standard construction techniques, another 161616 new binary linear codes that improve the lower bound on the minimum distance have also been obtained. Received: 9 November 2016 Accepted: 22 November 2017
In this paper, we consider a family of one-generator quasi-cyclic (QC) codes and their applications in quantum codes construction. We give a sufficient condition for one-generator QC codes to be self-orthogonal with respect to the symplectic inner product. As the computational results, five new binary quantum codes with parameters [[45,29,5]], [[63,36,7]], [[73,55,5]], [[105,71,7]], and [[105,72,7]] improving the best-known lower bounds on minimum distance in Grassl's code tables are constructed.