Variable-Length Non-Overlapping Codes

DOI10.1109/TIT.2017.2742506MaRDI QIDQ4566508zbMATH OpenOpenAlexFDO

Authors S. Bilotta

Publication date 27 June 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.03785

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called respectively fix-free code and non-overlapping code. In this paper, some constructive algorithms for such codes are presented as well as numerical results about their cardinality.

Cited in

(16)

• Convergence of the number of period sets in strings
• On the maximum size of variable-length non-overlapping codes
• A generalized construction of variable-length non-overlapping codes
• Variants of Wegman-Carter message authentication code supporting variable tag lengths
• A strong non-overlapping Dyck code
• Coding with variable block maps
• Non-overlapping matrices via Dyck words
• Two-dimensional q-ary non-overlapping codes
• scientific article; zbMATH DE number 5170141 (Why is no real title available?)
• Restricting Dyck paths and 312-avoiding permutations
• \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
• A Construction for Variable Dimension Strong Non-Overlapping Matrices
• New construction of non-expandable (1, k)-overlap-free codes
• scientific article; zbMATH DE number 6765487 (Why is no real title available?)
• Constructions of two-dimensional non-overlapping codes
• Non-Overlapping Codes

This page was built for publication: Variable-Length Non-Overlapping Codes

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