Huffman-type codes for infinite source distributions (Q1804258): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimal source codes for geometrically distributed integer alphabets (Corresp.) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Run-length encodings (Corresp.) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal source coding for a class of integer alphabets (Corresp.) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Finding a Single Defective in Binomial Group Testing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On optimal nested group testing algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Dichotomous Search for a Geometric Random Variable / rank | |||
Normal rank | |||
Revision as of 14:23, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Huffman-type codes for infinite source distributions |
scientific article |
Statements
Huffman-type codes for infinite source distributions (English)
0 references
11 May 1995
0 references
infinite source distribution
0 references
codeword length
0 references
geometric distribution
0 references
Huffman-type codes
0 references
