scientific article; zbMATH DE number 1559526
From MaRDI portal
Publication:4526974
zbMath0962.68060MaRDI QIDQ4526974
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (19)
Solving linear equations parameterized by Hamming weight ⋮ The complexity of error-correcting codes ⋮ FPT Suspects and Tough Customers: Open Problems of Downey and Fellows ⋮ NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem ⋮ 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 ⋮ Fast simplifications for Tarski formulas based on monomial inequalities ⋮ The minimum distance of parameterized codes on projective tori ⋮ Separating Models of Learning with Faulty Teachers ⋮ Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves ⋮ Affine Cartesian codes ⋮ On the tractability of some natural packing, covering and partitioning problems ⋮ Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ The intractability of computing the Hamming distance ⋮ Linear codes over signed graphs ⋮ Separating models of learning with faulty teachers ⋮ Integer SEC-DED codes for low power communications ⋮ Key masking using biometry
This page was built for publication:
