Permutation decoding of codes from generalized Paley graphs

DOI10.1007/S00200-013-0198-8MaRDI QIDQ371247zbMATH OpenOpenAlexFDO

Authors Padmapani Seneviratne, J. Limbupasiriporn

Publication date 30 September 2013

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-013-0198-8

zbMATH Keywords

codespermutation decodinggeneralized Paley graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Linear codes (general theory) (94B05) Applications of graph theory to circuits and networks (94C15) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 2170433
• Permutation decoding for codes from designs, finite geometries and graphs
• Permutation decoding for binary codes from lattice graphs
• Codes from lattice and related graphs, and permutation decoding
• Codes associated with circulant graphs and permutation decoding
• Permutation decoding for the binary codes from triangular graphs.
• Partial permutation decoding for simplex codes
• Partial permutation decoding of some binary codes from graphs on triples.
• Codes from multipartite graphs and minimal permutation decoding sets
• Partial permutation decoding for codes from finite planes

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1284430 (Why is no real title available?)
• scientific article; zbMATH DE number 2170433 (Why is no real title available?)
• A class of self-complementary graphs and lower bounds of some ramsey numbers
• Codes associated with circulant graphs and permutation decoding
• Codes associated with triangular graphs and permutation decoding
• Codes from incidence matrices and line graphs of Hamming graphs
• Codes from incidence matrices and line graphs of Paley graphs
• Codes from incidence matrices of graphs
• Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
• Information sets and partial permutation decoding for codes from finite geometries
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• On coverings
• On generalised Paley graphs and their automorphism groups
• Permutation Decoding of Systematic Codes
• Permutation decoding for binary codes from lattice graphs
• Reed-Muller codes and permutation decoding

Cited in

(11)

• Generalised Paley graphs with a product structure
• Binary codes from Paley graphs of prime-power-square order
• Codes associated with circulant graphs and permutation decoding
• \(LCD\) codes from adjacency matrices of graphs
• Conjectural permutation decoding of some AG codes
• Generalized Paley graphs equienergetic with their complements
• Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
• scientific article; zbMATH DE number 2170433 (Why is no real title available?)
• Codes from incidence matrices and line graphs of Paley graphs
• Codes from lattice and related graphs, and permutation decoding
• A reduction formula for Waring numbers through generalized Paley graphs

This page was built for publication: Permutation decoding of codes from generalized Paley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371247)