On the set of uniquely decodable codes with a given sequence of code word lengths (Q2374158): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4430300 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Uniquely Decipherable Codes with Two Codewords / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4529547 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two inequalities implied by unique decipherability / rank | |||
Normal rank | |||
Latest revision as of 03:50, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the set of uniquely decodable codes with a given sequence of code word lengths |
scientific article |
Statements
On the set of uniquely decodable codes with a given sequence of code word lengths (English)
0 references
14 December 2016
0 references
uniquely decodable code
0 references
prefix code
0 references
code with finite delay
0 references
Kraft's procedure
0 references
Sardinas-Patterson algorithm
0 references
