A lower bound for 0,1,* tournament codes

DOI10.1016/0012-365X(87)90147-6MaRDI QIDQ1095111zbMATH OpenOpenAlexFDO

Authors Karen L. Collins, John R. Stembridge, Peter W. Shor

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(87)90147-6

zbMATH Keywords

comma-free codestournament code

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Review text

A 0,1,* tournament code is a set of k-sequences from 0,1,* such that of any two words exactly one has a 1 in some place where the other has a zero. They are involved in a bound of Tang for comma-free codes. The authors construct a specific code of length \(m^ 2+m+1\) and size \(m^ 3+m^ 2+m+1\).

Recommendations

• scientific article; zbMATH DE number 975379
• A lower bound on the expected length of one-to-one codes
• Combinatorial lower bounds on binary codes with covering radius one
• scientific article; zbMATH DE number 6004879
• A lower bound for ternary constant weight codes
• On lower bounds for covering codes
• Lower bounds for q-ary codes of covering radius one
• On a lower bound on the number of perfect binary codes
• Lower bounds for binary covering codes
• Lower bounds for q-ary covering codes

Cites work

• Comma-Free Codes
• scientific article; zbMATH DE number 3930895 (Why is no real title available?)
• Regent Results in Comma-Free Codes

Cited in

(4)

• Matchings and covers in hypergraphs
• Tournament Coding of Integer Sequences
• scientific article; zbMATH DE number 3930895 (Why is no real title available?)
• scientific article; zbMATH DE number 975379 (Why is no real title available?)

This page was built for publication: A lower bound for 0,1,* tournament codes

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