scientific article; zbMATH DE number 1559526

MaRDI QIDQ4526974zbMATH OpenFDO

Authors Alexander Vardy

Publication date 28 February 2001

zbMATH Keywords

algorithmic complexity problemscoding theory

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The intractability of computing the minimum distance of a code
• Sur la complexité d'un problème de codage
• scientific article; zbMATH DE number 1284420
• The complexity of computing the covering radius of a code
• scientific article; zbMATH DE number 837790

Cited in

(28)

• Separating models of learning with faulty teachers
• Linear codes over signed graphs
• Affine Cartesian codes
• Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
• Solving linear equations parameterized by Hamming weight
• Separating Models of Learning with Faulty Teachers
• Sur la complexité d'un problème de codage
• scientific article; zbMATH DE number 4047170 (Why is no real title available?)
• Fast simplifications for Tarski formulas based on monomial inequalities
• The minimum distance of parameterized codes on projective tori
• scientific article; zbMATH DE number 1008507 (Why is no real title available?)
• The intractability of computing the minimum distance of a code
• NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
• On the tractability of some natural packing, covering and partitioning problems
• scientific article; zbMATH DE number 837790 (Why is no real title available?)
• Parameterized intractability of even set and shortest vector problem from Gap-ETH
• The complexity of error-correcting codes
• The intractability of computing the Hamming distance
• Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
• Attack on a code-based signature scheme from QC-LDPC codes
• Security enhancement method using shortened error correcting codes
• Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE
• Theoretical proof for the number of errors that one linear code detects/corrects when linear quasigroups of order 4 are used for coding
• Constructing optimal linear codes for code-based masking schemes of higher-orders
• More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
• Integer SEC-DED codes for low power communications
• Key masking using biometry

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 Q4526974)