scientific article; zbMATH DE number 3859037
From MaRDI portal
Publication:3328459
zbMATH Open0539.94028MaRDI QIDQ3328459FDOQ3328459
Authors: Gérard Battail 
Publication date: 1983
Title of this publication is not available (Why is that?)
Recommendations
- Trellis decoding complexity of linear block codes
- scientific article; zbMATH DE number 1106311
- scientific article; zbMATH DE number 1181550
- Decoding complexity of linear block codes
- On complexity of trellis structure of linear block codes
- scientific article; zbMATH DE number 1135091
- Efficient maximum likelihood decoding of linear block codes using a trellis
- A New Decoding Algorithm for Complete Decoding of Linear Block Codes
- On the trellis complexity of certain binary linear block codes
Cited In (8)
- Symbol-by-symbol decoding as an approximation of word-by-word decoding
- Decoding by local optimization (Corresp.)
- Partial-optimal piecewise decoding of linear codes
- Pipeline decoding of embedded trellis codes: Error-tolerance analysis
- Efficient maximum likelihood decoding of linear block codes using a trellis
- Maximum-likelihood list decoding using trellises
- Soft trellis-based decoder for linear block codes
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328459)
