Two New Four-Error-Correcting Binary Codes

Authors:
Patric R. Östergård
Affiliations:
Department of Electrical and Communications Engineering, Helsinki University of Technology, HUT, Finland 02015
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 5
Cited 0

Codes from Affine Permutation Groups

Designs, Codes and Cryptography
Classifying Subspaces of Hamming Spaces

Designs, Codes and Cryptography
A fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
New single-error-correcting codes

IEEE Transactions on Information Theory
A table of upper bounds for binary codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maximum clique algorithm.