A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings (Q886384)
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 5167812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings |
scientific article; zbMATH DE number 5167812 |
Statements
A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings (English)
0 references
27 June 2007
0 references
turbo codes
0 references
permutation polynomial
0 references
interleavers
0 references
contention-free interleaver design
0 references
turbo decoding
0 references
0.9266428351402284
0 references
0.8639889359474182
0 references
0.8320452570915222
0 references
0.8031414151191711
0 references
0.7888646125793457
0 references
