Ternary codes from graphs on triples

DOI10.1016/J.DISC.2008.05.032MaRDI QIDQ1044933zbMATH OpenOpenAlexFDO

Authors J. D. Key, Jamshid Moori, B. G. Rodrigues

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.05.032

zbMATH Keywords

ternary codeuniform-subset graph

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Review text

In a previous paper, the authors obtained the properties of the binary codes formed from the span of an adjacency matrix of each of the three graphs with vertex set B, where B is the set of subsets of a set A of size large than 6, and with adjacency defined by two vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively. In this paper, it is shown that the ternary codes of these graphs have similar properties to the binary codes. The paper gives the main parameters of these ternary codes, the proof of which follows from a series of lemmas and propositions.

Recommendations

• Binary codes from graphs on triples
• Ternary graph theoretic error-correcting codes (Corresp.)
• Ternary codes from some reflexive uniform subset graphs
• Binary codes from graphs on triples and permutation decoding
• Ternary codes of steiner triple systems
• A note on the binary codes from triangular graphs
• Analogue of vertex operator triality for ternary codes
• On the dual binary codes of the triangular graphs
• scientific article; zbMATH DE number 5951771
• scientific article; zbMATH DE number 1286741

Cites work

• Binary codes from graphs on triples
• Binary codes from graphs on triples and permutation decoding
• 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?)
• On the graphs of Hoffman-Singleton and Higman-Sims
• Partial permutation decoding of some binary codes from graphs on triples.
• The Magma algebra system. I: The user language

Cited in

(19)

• \(LCD\) codes from adjacency matrices of graphs
• Codes from adjacency matrices of uniform subset graphs
• Ternary codes and Jacobi forms
• Binary codes from graphs on triples
• 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)\)
• Ternary codes from some reflexive uniform subset graphs
• Codes from the incidence matrices of graphs on 3-sets
• Three-weight codes, triple sum sets, and strongly walk regular graphs
• Binary codes from reflexive uniform subset graphs on 3-sets
• Hulls of codes from incidence matrices of connected regular graphs
• On triply even binary codes
• scientific article; zbMATH DE number 5951771 (Why is no real title available?)
• scientific article; zbMATH DE number 1286741 (Why is no real title available?)
• Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
• Families of ternary (t,m,s)-nets related to BCH-codes
• Linear ternary codes of strongly regular signed graphs
• Designer of codes: a tribute to Jennifer Key
• On the dual binary codes of the triangular graphs

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Ternary codes from graphs on triples

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