Minimal permutation sets for decoding the binary Golay codes (Corresp.)

Authors:
D. Gordon
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

Binary codes from the line graph of the n-cube

Journal of Symbolic Computation
Note: Antiblocking decoding

Discrete Applied Mathematics
Codes from lattice and related graphs, and permutation decoding

Discrete Applied Mathematics
Information sets and partial permutation decoding for codes from finite geometries

Finite Fields and Their Applications
Hulls of codes from incidence matrices of connected regular graphs

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

For permutation decoding of aneerror-correcting linear code, a set of permutations which move all error vectors of weightleq eout of the information places is needed. A method of finding minimal decoding sets is given, along with minimal sets obtained with this method for the binary Golay codes.