scientific article; zbMATH DE number 1284420
From MaRDI portal
Publication:4242014
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
Recommendations
Cited in
(41)- A method for efficiently computing the number of codewords of fixed weights in linear codes
- On those Boolean functions that are coset leaders of first order Reed-Muller codes
- scientific article; zbMATH DE number 1004583 (Why is no real title available?)
- Sur la complexité d'un problème de codage
- Asymptotic behaviour of codes in rank metric over finite fields
- McEliece Cryptosystem Implementation: Theory and Practice
- Complexity aspects of guessing prefix codes
- Gröbner bases and combinatorics for binary codes
- scientific article; zbMATH DE number 4047170 (Why is no real title available?)
- \textsf{FuLeeca}: a Lee-based signature scheme
- LDPC codes from Singer cycles
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Decoding one out of many
- Comments on ``Integer SEC-DED codes for low power communications
- Hamming codes for wet paper steganography
- On the decoding of binary cyclic codes with the Newton identities
- DAGS: key encapsulation using dyadic GS codes
- On the weak order ideal associated to linear codes
- Some Problems in Organic Coding Theory
- Diagnosis of partially observed Petri net based on analytical redundancy relationships
- Links between complexity theory and constrained block coding
- Decomposition of modular codes for computing test sets and Graver basis
- Hard Problems of Algebraic Geometry Codes
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Separating Models of Learning with Faulty Teachers
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- Coset leaders of the first order Reed-Muller codes in the classes of Niho functions and threshold functions
- The complexity of error-correcting codes
- On a Gröbner bases structure associated to linear codes
- scientific article; zbMATH DE number 1284433 (Why is no real title available?)
- Error-correction of linear codes via colon ideals
- On the ideal associated to a linear code
- A commutative algebra approach to linear codes
- On the Gröbner bases of some symmetric systems and their application to coding theory.
- Trial set and Gröbner bases for binary codes
- scientific article; zbMATH DE number 1559526 (Why is no real title available?)
- Some Applications of Coding Theory in Computational Complexity
- Bounded distance decoding of linear error-correcting codes with Gröbner bases
- The hardness of decoding linear codes with preprocessing
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)
