Sammanfattning
In B tailbiting trellis encoder, the starting
state of the encoder is set to the state at which
the machine will be at the end of the encoded frame.
By this means the probability of decoding error at the
end of the frame can be kept low without the addition
of termination bits and the consequent rate loss. We
report on an extensive search for short and moderatelength
convoluticinal encoders for tailbiting trellis representations
of bllock codes at rates 1/4, 1/3, 1/2, and
2/3. The short tailbiting representations found are
typically as good as the best known block codes.
state of the encoder is set to the state at which
the machine will be at the end of the encoded frame.
By this means the probability of decoding error at the
end of the frame can be kept low without the addition
of termination bits and the consequent rate loss. We
report on an extensive search for short and moderatelength
convoluticinal encoders for tailbiting trellis representations
of bllock codes at rates 1/4, 1/3, 1/2, and
2/3. The short tailbiting representations found are
typically as good as the best known block codes.
| Originalspråk | engelska |
|---|---|
| Titel på värdpublikation | [Host publication title missing] |
| Sidor | 389 |
| DOI | |
| Status | Published - 1998 |
| Evenemang | IEEE International Symposium on Information Theory (ISIT), 1998 - Cambridge, MA, Cambridge, MA, USA Varaktighet: 1998 aug. 16 → 1998 aug. 21 |
Konferens
| Konferens | IEEE International Symposium on Information Theory (ISIT), 1998 |
|---|---|
| Land/Territorium | USA |
| Ort | Cambridge, MA |
| Period | 1998/08/16 → 1998/08/21 |
Ämnesklassifikation (UKÄ)
- Elektroteknik och elektronik