Finite maximal codes and triangle conjecture

DOI10.1016/j.disc.2016.10.008zbMath1407.94065OpenAlexW2552028135WikidataQ123122970 ScholiaQ123122970MaRDI QIDQ729792

Liang Zhang, Kar Ping 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

free monoidsregular codescommutative 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of Hajós factorizations to variable-length codes
• A counterexample to the triangle conjecture
• Construction of a family of finite maximal codes
• A conjecture on sets of differences of integer pairs
• On codes having no finite completions
• A partial result about the factorization conjecture for finite variable- length codes
• A property of finite maximal codes
• Hajós factorizations and completion of codes.
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• On codes having no finite completion