Abstract
Given a nonnegative sequence α of integers with Kraftsum at most 3/4, Ahlswede, Balkenhol and Khachatrian proposed the existence of a fix-free code with exactly α n words for any length n. In this article complete thin fix-free codes are constructed and both so-called n-closed systems and multiplication are used to enlarge this class. In addition, a sufficient criterion is given in terms of elementary sequence-shifting preserving the fix-freedom of the associated code. © Springer-Verlag Berlin Heidelberg 2013.
Author supplied keywords
Cite
CITATION STYLE
Bodewig, M. (2013). Multiplied complete fix-free codes and shiftings regarding the 3/4-conjecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 694–710). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
