Art of constructing low-complexity encoders/decoders for constrained block codes
Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword assignment from 2/sup p/ p-bit datawords to 2/sup p/ q-bit codewords, and the corresponding block decoder is the inverse of the encoder. We pr...
Saved in:
| Published in: | Information Theory: 2000 IEEE International Symposium On p. 147 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
2000
|
| Subjects: | |
| ISBN: | 9780780358577, 0780358570 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

