There are infinitely many complete prefix codes of constant length \(l\;(l\geq 3)\)

DOI10.1016/0304-3975(80)90021-3zbMath0433.68066OpenAlexW2116409989MaRDI QIDQ1139382

Angelo Barone-Netto

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90021-3

zbMATH Keywords

complete prefix codesconstant length

Mathematics Subject Classification ID

Artificial intelligence (68T99) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• On a Special Class of Recurrent Events

This page was built for publication: There are infinitely many complete prefix codes of constant length \(l\;(l\geq 3)\)