Permutation decoding for the binary codes from triangular graphs

Authors:
J. D. Key;J. Moori;B. G. Rodrigues
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson SC;School of Mathematics, Statistics and Information Technology, University of Natal-Pietermaritzburg, Pietermaritzburg 3209, South Africa;School of Mathematics, Statistics and Information Technology, University of Natal-Pietermaritzburg, Pietermaritzburg 3209, South Africa
Venue:
European Journal of Combinatorics
Year:
2004

Citing 5
Cited 8

Combinatorial configurations, designs, codes, graphs

Combinatorial configurations, designs, codes, graphs
Designs and their codes

Designs and their codes
On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs

Journal of Algebraic Combinatorics: An International Journal
Designs and Codes: An update

Designs, Codes and Cryptography - Special issue containing papers presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries
Binary Codes of Strongly Regular Graphs

Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus

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
On the dual binary codes of the triangular graphs

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

International Journal of Information and Coding Theory
Codes from lattice and related graphs, and permutation decoding

Discrete Applied Mathematics
Binary codes of some strongly regular subgraphs of the McLaughlin graph

Designs, Codes and Cryptography
Codes associated with circulant graphs and permutation decoding

Designs, Codes and Cryptography
Hulls of codes from incidence matrices of connected regular graphs

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

By finding explicit PD-sets we show that permutation decoding can be used for the binary code obtained from an adjacency matrix of the triangular graph T(n) for any n ≥ 5.