On the ratio of prefix codes to all uniquely decodable codes with a given length distribution (Q1752605): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3714479 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on free subsemigroups with two generators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(d\)-words and \(d\)-languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three-element codes with one \(d\)-primitive word / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4824568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two inequalities implied by unique decipherability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the set of uniquely decodable codes with a given sequence of code word lengths / rank | |||
Normal rank |
Revision as of 16:23, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the ratio of prefix codes to all uniquely decodable codes with a given length distribution |
scientific article |
Statements
On the ratio of prefix codes to all uniquely decodable codes with a given length distribution (English)
0 references
24 May 2018
0 references
uniquely decodable code
0 references
prefix code
0 references
length distribution
0 references
Kraft's inequality
0 references
Sardinas-Patterson algorithm
0 references