Pages that link to "Item:Q4392377"

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

Displaying 43 items.

• ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
• A formula on the weight distribution of linear codes with applications to AMDS codes (Q2667076) (← links)
• New binary and ternary quasi-cyclic codes with good properties (Q2687503) (← links)
• On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
• A generalization of cyclic code equivalence algorithm to constacyclic codes (Q2692951) (← links)
• A Survey of the Game “Lights Out!” (Q2848975) (← links)
• Inapproximability of the shortest vector problem: toward a deterministic reduction (Q2913823) (← links)
• Ensuring Message Embedding in Wet Paper Steganography (Q3104699) (← links)
• Update on the Extension of Good Linear Codes (Q3439645) (← links)
• On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids (Q3449854) (← links)
• An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm (Q3460472) (← links)
• A New Efficient Threshold Ring Signature Scheme Based on Coding Theory (Q3535347) (← links)
• COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES (Q3562516) (← links)
• Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
• (Q4638056) (← links)
• Geometrical organization of solutions to random linear Boolean equations (Q4968895) (← links)
• (Q4990142) (← links)
• Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
• Linear codes from vectorial Boolean functions in the context of algebraic attacks (Q5013480) (← links)
• Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius (Q5041210) (← links)
• Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
• (Q5091216) (← links)
• The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← links)
• (Q5241155) (← links)
• (Q5241182) (← links)
• MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS (Q5249044) (← links)
• Sparse Solutions of Linear Diophantine Equations (Q5737776) (← links)
• A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (Q5739036) (← links)
• (Q5855731) (← links)
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892431) (← links)
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
• On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
• Detection and recognition of a binary linear code (Q5939245) (← links)
• (Q6058502) (← links)
• New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes (Q6112234) (← links)
• A new algorithm for equivalence of cyclic codes and its applications (Q6115441) (← links)
• New quantum codes from self-dual codes over \(\mathbb{F}_4\) (Q6130618) (← links)
• Generalized weights of codes over rings and invariants of monomial ideals (Q6138907) (← links)
• Good classical and quantum codes from multi-twisted codes (Q6162717) (← links)
• The weight distribution of codes over finite chain rings (Q6168547) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
• Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures (Q6600001) (← links)
• Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)