A lower bound for 0,1,* tournament codes
type: Item
instance of: scholarly article
title: A lower bound for 0,1,* tournament codes
zbMATH Open document ID: 0631.94014
DOI: 10.1016/0012-365X(87)90147-6
author: Karen L. Collins
author: John R. Stembridge
author: Peter W. Shor
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
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\).
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 4027354
zbMATH Keywords: tournament code
zbMATH Keywords: comma-free codes
reviewed by: Ki Hang Kim
MaRDI profile type: Publication
cites work: Comma-Free Codes
cites work: Regent Results in Comma-Free Codes
cites work: Q3705356
full work available at URL: 0012-365x(87)90147-6
OpenAlex ID: W2064609917
Recommended article: Q5284052
Recommended article: A lower bound on the expected length of one-to-one codes
Recommended article: Combinatorial lower bounds on binary codes with covering radius one
Recommended article: Q3115607
Recommended article: A lower bound for ternary constant weight codes
Recommended article: On lower bounds for covering codes
Recommended article: Lower bounds for \(q\)-ary codes of covering radius one
Recommended article: On a lower bound on the number of perfect binary codes
Recommended article: Lower bounds for binary covering codes
Recommended article: Lower bounds for q-ary covering codes
description: scientific article; zbMATH DE number 4027354