Permutation decoding for the binary codes from triangular graphs.
type: Item
instance of: scholarly article
title: Permutation decoding for the binary codes from triangular graphs.
zbMATH Open document ID: 1049.94024
published in: European Journal of Combinatorics
publication date: 2004-02-14T00:00:00Z
review text: Permutation decoding is an algorithm for decoding linear codes introduced by \textit{F. J. MacWilliams} [Bell Syst. Tech. J. 43, 485--505 (1964; Zbl 0116.35304)] that uses certain sets (called PD-sets) of permutations in the automorphism group of the code. The paper investigates PD-sets for the binary linear codes spanned by the rows of the adjacency matrix of a triangular graph \(T(n)\), having as vertices the 2-element subsets of a given set of size \(n\). Explicit PD-sets are found for every \(n\geq 5\).
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 2041882
zbMATH Keywords: permutation decoding
zbMATH Keywords: triangular graph
author: J. D. Key
author: Jamshid Moori
author: B. G. Rodrigues
reviewed by: Vladimir D. Tonchev
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: j.ejc.2003.08.001
OpenAlex ID: W1982315026
cites work: Q4004114
cites work: Designs and codes: An update
cites work: Q4234284
cites work: On the \(p\)-rank of the adjacency matrices of strongly regular graphs
cites work: Q3218138
cites work: Minimal permutation sets for decoding the binary Golay codes (Corresp.)
cites work: Binary codes of strongly regular graphs
cites work: Q4242024
cites work: Permutation Decoding of Systematic Codes
cites work: Q4146667
cites work: On coverings
cites work: Q4040243
DOI: 10.1016/J.EJC.2003.08.001
description: scientific article; zbMATH DE number 2041882