scientific article; zbMATH DE number 4104862
From MaRDI portal
Publication:3829477
zbMATH Open0674.94015MaRDI QIDQ3829477FDOQ3829477
Authors: Martin Bossert
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
minimum distancebinary quadratic residue codesdecoding algorithm for binary linear codesViterbi decoding of convolutional codes
Cited In (15)
- On the pless-construction and ML decoding of the (48, 24, 12) quadratic residue code
- Algebraic decoding of the (32, 16, 8) quadratic residue code
- The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
- Decoding the (47,24,11) quadratic residue code
- A cyclic weight algorithm of decoding the \((47, 24, 11)\) quadratic residue code
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decoding of redundant residue polynomial codes using Euclid's algorithm
- Legendre sums and codes related to QR codes
- Statistical Decoding of Codes over $\mathbb{F}_q$
- Tables of coverings for decoding by \(S\)-sets
- Two-level decoding of the \((32,16,8)\) quadratic residue code
- Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)
- On the \([32,16,8]\) BCH and quadratic residue codes
- Decoding the \((41,20,10)\) quadratic residue code beyond its error-correcting capability
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 Q3829477)