Pages that link to "Item:Q4392377"

The following pages link to The intractability of computing the minimum distance of a code (Q4392377):

Displaying 50 items.

• Algorithms for the minimum weight of linear codes (Q259293) (← links)
• 3SUM, 3XOR, triangles (Q261365) (← links)
• A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm (Q307897) (← links)
• Some new quasi-twisted ternary linear codes (Q307933) (← links)
• Solving linear equations parameterized by Hamming weight (Q309792) (← links)
• Counting 2-connected deletion-minors of binary matroids (Q385399) (← links)
• A new iterative computer search algorithm for good quasi-twisted codes (Q498982) (← links)
• Blocking optimal arborescences (Q507342) (← links)
• Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes (Q514545) (← links)
• Algebraic geometric codes on anticanonical surfaces (Q616327) (← links)
• A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
• Boolean autoencoders and hypercube clustering complexity (Q690669) (← links)
• Key masking using biometry (Q764394) (← links)
• The complexity of the weight problem for permutation and matrix groups. (Q960944) (← links)
• \((l,s)\)-extension of linear codes (Q998537) (← links)
• A method for efficiently computing the number of codewords of fixed weights in linear codes (Q1005242) (← links)
• A search algorithm for linear codes: Progressive dimension growth (Q1009177) (← links)
• On the Gröbner bases of some symmetric systems and their application to coding theory. (Q1426139) (← links)
• New linear codes from constacyclic codes (Q1659442) (← links)
• New binary linear codes from quasi-cyclic codes and an augmentation algorithm (Q1675490) (← links)
• Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
• Blocking unions of arborescences (Q1751195) (← links)
• Blocking optimal structures (Q1752656) (← links)
• The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
• Computing sparse multiples of polynomials (Q1934308) (← links)
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids (Q1938503) (← links)
• Some new linear codes from skew cyclic codes and computer algebra challenges (Q2002144) (← links)
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
• Two new zero-dimensional qubit codes from bordered metacirculant construction (Q2037568) (← links)
• Characteristic vector and weight distribution of a linear code (Q2040349) (← links)
• Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
• Lights Out on graphs (Q2088176) (← links)
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
• Polycyclic codes associated with trinomials: good codes and open questions (Q2132449) (← links)
• Coding theory package for Macaulay2 (Q2138423) (← links)
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
• On the complexity of and solutions to the minimum stopping and trapping set problems (Q2143118) (← links)
• Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
• Cyclic distances of idempotent convolutional codes (Q2200297) (← links)
• On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators (Q2229848) (← links)
• Some generalizations of the ASR search algorithm for quasitwisted codes (Q2299419) (← links)
• Moment subset sums over finite fields (Q2302567) (← links)
• Minimal distance of propositional models (Q2322705) (← links)
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes (Q2324762) (← links)
• New linear codes over non-prime fields (Q2325292) (← links)
• The highly connected matroids in minor-closed classes (Q2343467) (← links)
• Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921) (← links)
• A generalization of quasi-twisted codes: multi-twisted codes (Q2396753) (← links)
• On the (co)girth of a connected matroid (Q2462384) (← links)
• The asymptotic probability distribution of the relative distance of additive quantum codes (Q2467792) (← links)