Searching for linear codes with large minimum distance
From MaRDI portal
Recommendations
Cited in
(84)- A Heuristic Algorithm for the Construction of Good Linear Codes
- The automorphism group of an extremal [120, 60, 24] code does not contain elements of order 29
- Algorithm 994: Fast implementations of the Brouwer-Zimmermann algorithm for the computation of the minimum distance of a random linear code
- On the automorphism group of a binary self-dual \([120, 60, 24]\) code
- A class of primitive BCH codes and their weight distribution
- Algorithms for the minimum weight of linear codes
- On the automorphisms of order 15 for a binary self-dual \([96, 48, 20]\) code
- Several new classes of linear codes with few weights
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Binary construction of pure additive quantum codes with distance five or six
- Nonassociative algebraic structures in cryptography and coding
- The nonexistence of near-extremal formally self-dual codes
- Quasigroups and rings in coding theory and cryptography
- New constructions of quantum stabilizer codes based on difference sets
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- On self-dual and LCD double circulant and double negacirculant codes over \(\mathbb{F}_q+u\mathbb{F}_q \)
- Cyclotomic trace codes
- Boolean functions with six-valued Walsh spectra and their application
- Additive double polycyclic codes over \(\mathbb{F}_{p^2}\) and their applications to quantum codes
- Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\)
- An extension of the Brouwer-Zimmermann minimum weight algorithm
- On complementary dual quasi-twisted codes
- On symplectic hulls of linear codes and related applications
- A survey on the applications of Niho exponents
- Optimal minimal linear codes from posets
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- Construction of highly nonlinear resilient S-boxes with given degree
- Skew codes of prescribed distance or rank
- On circulant self-dual codes over small fields
- Error-correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
- An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem
- Good codes from metacyclic groups
- Two classes of constacyclic codes with variable parameters
- Construction of minimal non-abelian left group codes
- Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
- A search algorithm for linear codes: Progressive dimension growth
- Linear codes from vectorial Boolean functions in the context of algebraic attacks
- Algebraic Geometry Codes from Castle Curves
- Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
- New binary quantum codes from group rings and skew group rings
- Additive semisimple multivariable codes over \(\mathbb{F}_4\)
- A class of subfield codes of linear codes and their duals
- scientific article; zbMATH DE number 842890 (Why is no real title available?)
- Quantum error-correcting codes from algebraic geometry codes of castle type
- Construction methods for Galois LCD codes over finite fields
- Classic and Quantum Error Correcting Codes
- Algorithm 1059: LinCodeWeightInv -- library for computing the weight distribution of linear codes over finite fields
- An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
- Construction of quasi-cyclic self-dual codes over finite fields
- LCD codes from equitable partitions of association schemes
- An updated table of minimum-distance bounds for binary linear codes
- New binary quantum stabilizer codes from the binary extremal self-dual \([48,24,12]\) code
- The geometry of Hermitian self-orthogonal codes
- Multi-twisted codes as free modules over principal ideal domains
- On reversible codes over a non-chain ring
- Quaternary Unequal Error Protection Codes
- Two families of negacyclic BCH codes
- Three classes of binary linear codes with good parameters
- Codes and designs from triangular graphs and their line graphs
- On group codes with complementary duals
- scientific article; zbMATH DE number 3878836 (Why is no real title available?)
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
- A kind of three-weight linear codes
- A generalization of combinatorial designs and related codes
- New quantum codes from dual-containing cyclic codes over finite rings
- Constacyclic codes over local rings of order 16
- Construction of Linear Codes With Large Minimum Distance
- On the structure of some arcs related to caps and the nonexistence of some optimal codes
- On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes
- Lexicodes over rings
- ACD codes over \(\mathbb{Z}_2 \mathcal{R}\) and the MacWilliams identities
- Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings \(\mathbb{F}_q[v_1,v_2,\dots,v_t]\)
- Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
- Minimum distance computation of linear codes via genetic algorithms with permutation encoding
- The geometric approach to the existence of some quaternary Griesmer codes
- Self-orthogonal codes from equitable partitions of association schemes
- Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
- On the algebraic structure of \((\sigma, \bar{a})\)-polycyclic codes
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- The dimensions of Galois hulls of linear codes derived from an improved propagation rule and related applications
- Twisted centralizer codes
This page was built for publication: Searching for linear codes with large minimum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517216)
