The intractability of computing the minimum distance of a code
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Regular matroids have polynomial extension complexity
- scientific article; zbMATH DE number 7561552 (Why is no real title available?)
- Moment subset sums over finite fields
- A note on edge-based graph partitioning and its linear algebraic structure
- Sparse Solutions of Linear Diophantine Equations
- Detection and recognition of a binary linear code
- New results and bounds on codes over GF(19)
- Approximating the number of relevant variables in a parity implies proper learning
- Geometrical organization of solutions to random linear Boolean equations
- A deterministic reduction for the gap minimum distance problem (extended abstract)
- On the (co)girth of a connected matroid
- Lights Out on graphs
- Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Counting 2-connected deletion-minors of binary matroids
- Some new linear codes from skew cyclic codes and computer algebra challenges
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
- On the algebraic structure of \((\sigma, \bar{a})\)-polycyclic codes
- Minimal distance of propositional models
- New quantum codes from self-dual codes over \(\mathbb{F}_4\)
- Coding theory package for Macaulay2
- Update on the Extension of Good Linear Codes
- Boolean autoencoders and hypercube clustering complexity
- Hardness of approximating the minimum distance of a linear code
- Algorithms for the minimum weight of linear codes
- 3SUM, 3XOR, triangles
- New linear codes over non-prime fields
- New linear codes over \(\mathrm{GF}(3)\), \(\mathrm{GF}(11)\), and \(\mathrm{GF}(13)\)
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- Computing girth and cogirth in perturbed graphic matroids
- Cyclic distances of idempotent convolutional codes
- The distributions of functions related to parametric integer optimization
- Performance bounds for QC-MDPC codes decoders
- Several infinite families of binary cyclic codes with square-root-like lower bounds
- Computing the distance distribution of systematic nonlinear codes
- A formula on the weight distribution of linear codes with applications to AMDS codes
- An extension of the Brouwer-Zimmermann minimum weight algorithm
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- On the Hardness of Decoding the Gale–Berlekamp Code
- Cardinality minimization, constraints, and regularization: a survey
- \((l,s)\)-extension of linear codes
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Polycyclic codes associated with trinomials: good codes and open questions
- The complexity of the weight problem for permutation and matrix groups.
- Blocking unions of arborescences
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- New results and bounds on codes over \(\mathrm{GF}(17)\)
- The asymptotic probability distribution of the relative distance of additive quantum codes
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- Some new quasi-twisted ternary linear codes
- Solving linear equations parameterized by Hamming weight
- scientific article; zbMATH DE number 1559526 (Why is no real title available?)
- A generalization of quasi-twisted codes: multi-twisted 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
- Hard Problems of Algebraic Geometry Codes
- The weight distribution of codes over finite chain rings
- Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
- A new algorithm for equivalence of cyclic codes and its applications
- A simple deterministic reduction for the gap minimum distance of code problem
- A new iterative computer search algorithm for good quasi-twisted codes
- Good classical and quantum codes from multi-twisted codes
- A search algorithm for linear codes: Progressive dimension growth
- Linear codes from vectorial Boolean functions in the context of algebraic attacks
- Lexicographically smallest minimum weight vectors in binary codes
- Two new zero-dimensional qubit codes from bordered metacirculant construction
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- Inapproximability of the shortest vector problem: toward a deterministic reduction
- Algebraic geometric codes on anticanonical surfaces
- Mod-2 independence and domination in graphs
- A NP-complete problem in coding theory with application to code based cryptography
- Minimum distance bounds for linear codes over GF(11)
- Expand-convolute codes for pseudorandom correlation generators from LPN
- scientific article; zbMATH DE number 7758721 (Why is no real title available?)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms
- The complexity of computing the covering radius of a code
- Generalized Hamming weights and minimal shifts of Orlik-Terao algebras
- Generalized weights of codes over rings and invariants of monomial ideals
- On the maximum-likelihood decoding problem
- Low-complexity cryptographic hash functions
- The inapproximability of lattice and coding problems with preprocessing
- An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
- Key masking using biometry
- Characteristic vector and weight distribution of a linear code
- Higher-order root-finding algorithm and its applications
- New binary linear codes from quasi-cyclic codes and an augmentation algorithm
- On the complexity of and solutions to the minimum stopping and trapping set problems
- Computing the Stopping Distance of a Tanner Graph Is NP-Hard
- Some new ternary linear codes
- New linear codes from constacyclic codes
- Computing sparse multiples of polynomials
This page was built for publication: The intractability of computing the minimum distance of a code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392377)
