Work

Results on Binary Linear Codes With Minimum Distance 8 and 10

Year: 2011

Type: article

Abstract: All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact bounds for binary linear codes. Primarily two algorithms considering the dual codes are used, namely extension of dual codes with a proper coordinate, and a fast algorithm for finding a maximum clique in a graph, which is modified to find a maximum set of vectors with the right dependency structure.

Source: IEEE Transactions on Information Theory

DOI: 10.1109/tit.2011.2162264

Authors: Iliya Georgiev Bouyukliev, Erik Jacobsson

Institutions: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics, Chalmers University of Technology, University of Gothenburg

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2155925529

FWCI: 0.883

Cites: 17

Cited by: 4

Related to: 10