Regent Results in Comma-Free Codes
From MaRDI portal
Publication:3843991
DOI10.4153/CJM-1963-021-1zbMath0108.14304OpenAlexW2091716984MaRDI QIDQ3843991
Publication date: 1963
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1963-021-1
Related Items
A lower bound for 0,1,* tournament codes, Finite Completion of comma-free codes Part 1, Finite Completion of comma-free codes Part 2, Robust universal complete codes for transmission and compression, Binary templates for comma-free DNA codes, Hall sets, Lazard sets and comma-free codes, Completing comma-free codes, Computer-aided constructions of commafree codes, The comma-free codes with words of length two, Retrograde codes and bounded synchronization delay, Combinatorial problems motivated by comma‐free codes
