On the proportion of prefix codes in the set of three-element codes
From MaRDI portal
Publication:2185934
DOI10.1016/j.disc.2020.111939zbMath1448.94178arXiv2005.00301OpenAlexW3021767004MaRDI QIDQ2185934
Publication date: 8 June 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.00301
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A three-word code which is not prefix-suffix composed
- Three-element codes with one \(d\)-primitive word
- On three-element codes
- A property of three-element codes
- \(d\)-words and \(d\)-languages
- On the ratio of prefix codes to all uniquely decodable codes with a given length distribution
- On the set of uniquely decodable codes with a given sequence of code word lengths
- Completing codes
- A note on free subsemigroups with two generators
- Two inequalities implied by unique decipherability
This page was built for publication: On the proportion of prefix codes in the set of three-element codes
