Finding the permutation between equivalent linear codes: the support splitting algorithm

DOI10.1109/18.850662zbMATH Open1002.94037OpenAlexW2119117325MaRDI QIDQ4501759FDOQ4501759

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.850662

Recommendations

scientific article; zbMATH DE number 1880283
Is code equivalence easy to decide?
Computing an invariant of a linear code
On the equivalence of linear codes
About the code equivalence

zbMATH Keywords

weight enumerator linear codes signature invariant hull permutation-equivalent codes support splitting algorithm

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) General topics in the theory of algorithms (68W01)

Cited In (93)

Computing Autotopism Groups of Partial Latin Rectangles
Computational aspects of retrieving a representation of an algebraic geometry code
McEliece Cryptosystem Implementation: Theory and Practice
Structural cryptanalysis of McEliece schemes with compact keys
Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
Optimal binary and ternary linear codes with hull dimension one
On binary linear codes whose automorphism group is trivial
Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
LESS-FM: fine-tuning signatures from the code equivalence problem
Oblivious Transfer Based on the McEliece Assumptions
Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs
On the equivalence of cyclic and quasi-cyclic codes over finite fields
On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
Constructions and bounds on quaternary linear codes with Hermitian hull dimension one
On a Gröbner bases structure associated to linear codes
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
Hulls of linear codes revisited with applications
A new algorithm for equivalence of cyclic codes and its applications
Blakley type secret sharing scheme based on the intersection of subspaces
Hulls of cyclic and negacyclic codes over finite fields
Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
Structural properties of self-dual monomial codes with application to code-based cryptography
New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes
On Toeplitz codes of index \(t\) and isometry codes
A NP-complete problem in coding theory with application to code based cryptography
The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order
Linear codes with one-dimensional hull associated with Gaussian sums
MDS linear codes with one-dimensional hull
A new construction of linear codes with one-dimensional hull
Linear codes with arbitrary dimensional hull and their applications to EAQECCs
A Summary of McEliece-Type Cryptosystems and their Security
Linear codes with small hulls in semi-primitive case
On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
Practical post-quantum signature schemes from isomorphism problems of trilinear forms
Hulls of cyclic serial codes over a finite chain ring
General linear group action on tensors: a candidate for post-quantum cryptography
Characteristic vector and weight distribution of a linear code
Wild McEliece
An improved method for constructing formally self-dual codes with small hulls
Hulls of cyclic codes over \(\mathbb{Z}_4\)
Wild McEliece Incognito
An attack on a non-interactive key exchange from code equivalence
On the computational hardness of the code equivalence problem in cryptography
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
Hermitian hulls of constacyclic codes and a new family of entanglement-assisted quantum MDS codes
Galois hulls of linear codes over finite fields
Semantic security for the McEliece cryptosystem without random oracles
Hermitian hulls of constacyclic codes and their applications to quantum codes
Galois hulls of constacyclic codes over finite fields
Good integers and some applications in coding theory
New Galois hulls of generalized Reed-Solomon codes
Optimal quaternary Hermitian LCD codes and their related codes
The average dimension of the hull of cyclic codes.
Constructions of linear codes with small hulls from association schemes
A new method for constructing linear codes with small hulls
Quantum resistant public key encryption scheme polarRLCE
LESS is more: code-based signatures without syndromes
LCD codes from tridiagonal Toeplitz matrices
Explicit non-special divisors of small degree, algebraic geometric hulls, and LCD codes from Kummer extensions
Hermitian hull of constacyclic codes over a class of non-chain rings and new quantum codes
MDS codes with \(l\)-Galois hulls of arbitrary dimensions
Monomial isomorphism for tensors and applications to code equivalence problems
On Bose distance of a class of BCH codes with two types of designed distances
On two modifications of the McEliece PKE and the CFS signature scheme
MDS multi-twisted Reed-Solomon codes with small dimensional hull
Title not available (Why is that?)
On cyclic and negacyclic codes with one-dimensional hulls and their applications
On symplectic hulls of linear codes and related applications
Title not available (Why is that?)
MDS codes with euclidean and Hermitian hulls of flexible dimensions and their applications to EAQECCs
A new formulation of the linear equivalence problem and shorter less signatures
On MDS codes with Galois hulls of arbitrary dimensions
A new approach based on quadratic forms to attack the McEliece cryptosystem
On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\)
A note on the hull and linear complementary pair of cyclic codes
Linear codes of larger lengths with Galois hulls of arbitrary dimensions and related entanglement-assisted quantum error-correcting codes
On LCD codes from skew symmetric Toeplitz matrices
New and improved formally self-dual codes with small hulls from polynomial four Toeplitz codes
On generalized monomial codes defined over sets with a special vanishing ideal
Optimal quaternary linear codes with one-dimensional Hermitian hull and related EAQECCs
Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
Hull attacks on the lattice isomorphism problem
Hulls of linear codes from simplex codes
The number of codes over rings of order 4 containing a hull of given type
Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
Title not available (Why is that?)
On abelian one-dimensional hull codes in group algebras
Additive one-rank hull codes over finite fields
Cryptanalysis of the BBCRS system on Reed-Muller binary code
Computing an invariant of a linear code
Several classes of Galois self-orthogonal MDS codes and related applications
Hardness estimates of the code equivalence problem in the rank metric

This page was built for publication: Finding the permutation between equivalent linear codes: the support splitting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501759)