scientific article; zbMATH DE number 1284420
zbMATH Open0929.94028MaRDI QIDQ4242014FDOQ4242014
Authors: Alexander Barg 
Publication date: 1 February 2000
Title of this publication is not available (Why is that?)
Recommendations
minimum distanceGilbert-Varshamov boundlinear codescoding theorydecodingcomplexity of algorithmsweight spectrumsoft decision decodinginformation set decodingasymptotically good codesasymptotic behaviour of algorithmscomputation of important numerical parametersconstruction of block codescovering set decodinggradient-like decodinghard decision decodinglist cascade decodingminimal vectors ML decodingpunctured split syndrom decodingsplit syndrom decodingsyndrom trellis decodingweighted partitions decoding
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to biology (92-02) Linear codes (general theory) (94B05) Decoding (94B35)
Cited In (41)
- McEliece Cryptosystem Implementation: Theory and Practice
- Trial Set and Gröbner Bases for Binary Codes
- Diagnosis of Partially Observed Petri Net Based on Analytical Redundancy Relationships
- Title not available (Why is that?)
- Links between complexity theory and constrained block coding
- Asymptotic behaviour of codes in rank metric over finite fields
- On the weak order ideal associated to linear codes
- The complexity of error-correcting codes
- On those Boolean functions that are coset leaders of first order Reed-Muller codes
- The hardness of decoding linear codes with preprocessing
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Title not available (Why is that?)
- On the decoding of binary cyclic codes with the Newton identities
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Coset leaders of the first order Reed-Muller codes in the classes of Niho functions and threshold functions
- A commutative algebra approach to linear codes
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- On a Gröbner bases structure associated to linear codes
- Title not available (Why is that?)
- Hard Problems of Algebraic Geometry Codes
- On the Gröbner bases of some symmetric systems and their application to coding theory.
- A method for efficiently computing the number of codewords of fixed weights in linear codes
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Separating Models of Learning with Faulty Teachers
- On the ideal associated to a linear code
- LDPC codes from Singer cycles
- Complexity aspects of guessing prefix codes
- Some Problems in Organic Coding Theory
- Comments on ``Integer SEC-DED codes for low power communications
- Some Applications of Coding Theory in Computational Complexity
- Gröbner bases and combinatorics for binary codes
- Decoding one out of many
- Hamming codes for wet paper steganography
- Title not available (Why is that?)
- Sur la complexité d'un problème de codage
- Error-correction of linear codes via colon ideals
- Decomposition of modular codes for computing test sets and Graver basis
- DAGS: key encapsulation using dyadic GS codes
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- \textsf{FuLeeca}: a Lee-based signature scheme
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
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 Q4242014)
