Codes from the line graphs of complete multipartite graphs and PD-sets
From MaRDI portal
Publication:2643315
DOI10.1016/j.disc.2006.11.008zbMath1138.94390OpenAlexW2051247518MaRDI QIDQ2643315
Padmapani Seneviratne, Jennifer D. Key
Publication date: 23 August 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.008
Applications of graph theory (05C90) Linear codes (general theory) (94B05) Finite geometry and special incidence structures (51E99)
Related Items (4)
Codes from lattice and related graphs, and permutation decoding ⋮ Codes associated with the odd graphs ⋮ Codes from incidence matrices of some Bouwer graphs ⋮ Codes from incidence matrices of some regular graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary codes from rectangular lattice graphs and permutation decoding
- Permutation decoding for binary codes from lattice graphs
- Permutation decoding for the binary codes from triangular graphs.
- Partial permutation decoding for codes from finite planes
- On coverings
- Information sets and partial permutation decoding for codes from finite geometries
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes
This page was built for publication: Codes from the line graphs of complete multipartite graphs and PD-sets