Codes from lattice and related graphs, and permutation decoding

Authors:
J. D. Key;B. G. Rodrigues
Affiliations:
School of Mathematical Sciences, University of KwaZulu-Natal, Pietermaritzburg 3209, South Africa;School of Mathematical Sciences, University of KwaZulu-Natal, Durban 4041, South Africa
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 10
Cited 1

On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs

Journal of Algebraic Combinatorics: An International Journal
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Binary Codes of Strongly Regular Graphs

Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
On the p-Ranks of the Adjacency Matrices of Distance-Regular Graphs

Journal of Algebraic Combinatorics: An International Journal
Permutation decoding for the binary codes from triangular graphs

European Journal of Combinatorics
Partial permutation decoding for codes from finite planes

European Journal of Combinatorics
Binary codes from rectangular lattice graphs and permutation decoding

European Journal of Combinatorics
Codes associated with triangular graphs and permutation decoding

International Journal of Information and Coding Theory
Binary codes from the line graph of the n-cube

Journal of Symbolic Computation
Minimal permutation sets for decoding the binary Golay codes (Corresp.)

IEEE Transactions on Information Theory

Hulls of codes from incidence matrices of connected regular graphs

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.05

Visualization

Abstract

Codes of length n^2 and dimension 2n-1 or 2n-2 over the field F"p, for any prime p, that can be obtained from designs associated with the complete bipartite graph K"n","n and its line graph, the lattice graph, are examined. The parameters of the codes for all primes are obtained and PD-sets are found for full permutation decoding for all integers n=3.