Permutation decoding of codes from generalized Paley graphs
From MaRDI portal
Publication:371247
DOI10.1007/s00200-013-0198-8zbMath1318.94114OpenAlexW2051414297MaRDI QIDQ371247
Jirapha Limbupasiriporn, Padmapani Seneviratne
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
Linear codes (general theory) (94B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of graph theory to circuits and networks (94C15) Decoding (94B35)
Related Items
Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd, \(LCD\) codes from adjacency matrices of graphs, Generalised Paley graphs with a product structure, Generalized Paley graphs equienergetic with their complements, Binary codes from Paley graphs of prime-power-square order, A reduction formula for Waring numbers through generalized Paley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes from incidence matrices and line graphs of Paley graphs
- Codes associated with triangular graphs and permutation decoding
- Reed-Muller codes and permutation decoding
- Permutation decoding for binary codes from lattice graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- On generalised Paley graphs and their automorphism groups
- Codes from incidence matrices of graphs
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- On coverings
- Codes associated with circulant graphs and permutation decoding
- Information sets and partial permutation decoding for codes from finite geometries
- A class of self-complementary graphs and lower bounds of some ramsey numbers
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes
