scientific article; zbMATH DE number 5499321
From MaRDI portal
Publication:5506328
zbMATH Open1155.94027MaRDI QIDQ5506328FDOQ5506328
Authors: A. V. Kelarev 
Publication date: 28 January 2009
Title of this publication is not available (Why is that?)
Recommendations
- Publication:4332871
- Algorithms for computing parameters of graph-based extensions of BCH codes
- scientific article; zbMATH DE number 1775631
- scientific article; zbMATH DE number 4059288
- Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
- Codes based on BCK-algebras
- On codes based on BCK-algebras
- scientific article; zbMATH DE number 3394018
- scientific article; zbMATH DE number 6444263
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
Cited In (9)
- A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code
- Algorithms for computing parameters of graph-based extensions of BCH codes
- A method for decoding a variable-rate error-correcting code based on finite-state automata
- A coding scheme that increases the code rate
- Primitive to non-primitive BCH codes: an instantaneous path shifting scheme for data transmission
- Randomized generation of error control codes with automata and transducers
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- Search algorithm for increase the performance of codes generated by finite automatons
- 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 Q5506328)
