scientific article; zbMATH DE number 1284420

zbMath0929.94028MaRDI QIDQ4242014

Alexander Barg

Publication date: 1 February 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear codesdecodingcoding theoryminimum distanceGilbert-Varshamov boundcomplexity 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Decoding (94B35) Research exposition (monographs, survey articles) pertaining to biology (92-02)

Related Items

On the weak order ideal associated to linear codes ⋮ Linear codes with complementary duals meet the Gilbert-Varshamov bound ⋮ On the ideal associated to a linear code ⋮ On those Boolean functions that are coset leaders of first order Reed-Muller codes ⋮ Comments on ``Integer SEC-DED codes for low power communications ⋮ Decomposition of modular codes for computing test sets and Graver basis ⋮ Separating Models of Learning with Faulty Teachers ⋮ Trial Set and Gröbner Bases for Binary Codes ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ McEliece Cryptosystem Implementation: Theory and Practice ⋮ On the Gröbner bases of some symmetric systems and their application to coding theory. ⋮ Error-correction of linear codes via colon ideals ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Gröbner bases and combinatorics for binary codes ⋮ On the decoding of binary cyclic codes with the Newton identities ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ A method for efficiently computing the number of codewords of fixed weights in linear codes ⋮ Diagnosis of Partially Observed Petri Net Based on Analytical Redundancy Relationships ⋮ On a Gröbner bases structure associated to linear codes ⋮ A commutative algebra approach to linear codes ⋮ LDPC codes from Singer cycles ⋮ Decoding One Out of Many ⋮ Hamming codes for wet paper steganography