An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.) (Q4124735)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.) |
scientific article; zbMATH DE number 3550599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.) |
scientific article; zbMATH DE number 3550599 |
Statements
An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.) (English)
0 references
1977
0 references
