Groups of finite elementary codes

DOI10.1016/0304-3975(93)90233-JzbMath0815.94007OpenAlexW2062843451MaRDI QIDQ685448

Masashi Katsura, Genjiro Tanaka

Publication date: 9 July 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90233-j

zbMATH Keywords

primitive groupsfinite indecomposable elementary codesteam tournament

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• A graph covering construction of all the finite complete biprefix codes
• Team tournaments and finite elementary codes
• Some Applications of the Wreath Product Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Groups of finite elementary codes