A note on performance of generalized tail biting trellis codes
From MaRDI portal
Recommendations
- Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
- Constructions of generalized concatenated codes and their trellis-based decoding complexity
- Code construction and decoding of parallel concatenated tail-biting codes
- Tailbiting codes: bounds and search results
- On Tail Biting Convolutional Codes
Cites work
- Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
- Convolutional codes II. Maximum-likelihood decoding
- Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
- On Tail Biting Convolutional Codes
- The complexity of decoders--II: Computational work and decoding time
Cited in
(5)- Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
- On Tail Biting Convolutional Codes
- Binary unequal error-protection block codes formed from convolutional codes by generalized tail-biting
- Code construction and decoding of parallel concatenated tail-biting codes
- A note on tailbiting codes and their feedback encoders
This page was built for publication: A note on performance of generalized tail biting trellis codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005858)