Finite maximal codes and triangle conjecture

DOI10.1016/J.DISC.2016.10.008MaRDI QIDQ729792zbMATH OpenOpenAlexWikidataFDO

Authors Liang Zhang, K. P. Shum

Publication date 22 December 2016

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

regular codesfree monoidscommutative equivalence conjecturefinite maximal codesfinitely completable codestriangle conjecture

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Recommendations

• Supplemented results of finite maximal codes related to the triangle conjecture proposed by D. Perrin and M. P. Schützenbeger
• scientific article; zbMATH DE number 1047910
• scientific article; zbMATH DE number 2044502
• A note with computer exploration on the triangle conjecture
• On the factorization conjecture

Cites work

• scientific article; zbMATH DE number 4043285 (Why is no real title available?)
• scientific article; zbMATH DE number 3760085 (Why is no real title available?)
• scientific article; zbMATH DE number 3767068 (Why is no real title available?)
• scientific article; zbMATH DE number 1047910 (Why is no real title available?)
• scientific article; zbMATH DE number 1047958 (Why is no real title available?)
• scientific article; zbMATH DE number 3058897 (Why is no real title available?)
• A conjecture on sets of differences of integer pairs
• A counterexample to the triangle conjecture
• A partial result about the factorization conjecture for finite variable- length codes
• A property of finite maximal codes
• An application of Hajós factorizations to variable-length codes
• Codes and automata.
• Construction of a family of finite maximal codes
• Hajós factorizations and completion of codes.
• On codes having no finite completion
• On codes having no finite completions
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES

Cited in

(5)

• Supplemented results of finite maximal codes related to the triangle conjecture proposed by D. Perrin and M. P. Schützenbeger
• Finite maximal codes and factorizations of cyclic groups
• A note with computer exploration on the triangle conjecture
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• A counterexample to the triangle conjecture

This page was built for publication: Finite maximal codes and triangle conjecture

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