Permutation decoding for the binary codes from triangular graphs.
From MaRDI portal
Publication:1422399
DOI10.1016/j.ejc.2003.08.001zbMath1049.94024OpenAlexW1982315026MaRDI QIDQ1422399
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues
Publication date: 14 February 2004
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2003.08.001
Related Items
PD-sets for the codes from incidence matrices of triangular graphs, \(LCD\) codes from adjacency matrices of graphs, Binary codes from rectangular lattice graphs and permutation decoding, On the dual binary codes of the triangular graphs, Designs and codes from fixed points of alternating groups, Codes from the line graphs of complete multipartite graphs and PD-sets, Unnamed Item, Codes from lattice and related graphs, and permutation decoding, Designs and codes from involutions of An, Binary codes of some strongly regular subgraphs of the McLaughlin graph, The weight distribution of hulls of binary codes from incidence matrices of complete graphs, Special \textit{LCD} codes from products of graphs, Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), On the constructions of holomorphic vertex operator algebras of central charge 24, Codes from incidence matrices of graphs, Hulls of codes from incidence matrices of connected regular graphs, Codes associated with circulant graphs and permutation decoding, Unnamed Item, Codes and designs from triangular graphs and their line graphs, Permutation decoding for binary codes from lattice graphs, Binary codes and partial permutation decoding sets from the Johnson graphs, Antiblocking systems and PD-sets, PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\), Symmetric 1-designs from PGL2(q), for q an odd prime power, On linear codes admitting large automorphism groups, Hamming graphs and special LCD codes, Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\), Partial permutation decoding for codes from finite planes, On the existence of PD-sets: algorithms arising from automorphism groups of codes, Codes from multipartite graphs and minimal permutation decoding sets, A useful tool for constructing linear codes, Optimal antiblocking systems of information sets for the binary codes related to triangular graphs, Binary codes from graphs on triples, Codes from incidence matrices of some Bouwer graphs, Codes from incidence matrices of some regular graphs, Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
Uses Software
Cites Work
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Designs and codes: An update
- Binary codes of strongly regular graphs
- On coverings
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
