On bit-level trellis complexity of Reed-Muller codes (Q4880338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 884900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On bit-level trellis complexity of Reed-Muller codes |
scientific article; zbMATH DE number 884900 |
Statements
On bit-level trellis complexity of Reed-Muller codes (English)
0 references
15 September 1996
0 references
trellis complexity
0 references
trellis
0 references
Reed-Muller code
0 references
0.8622512817382812
0 references
0.8184290528297424
0 references
0.8093919157981873
0 references
