Finding the permutation between equivalent linear codes: the support splitting algorithm
From MaRDI portal
Publication:4501759
DOI10.1109/18.850662zbMath1002.94037MaRDI QIDQ4501759
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
signature; linear codes; weight enumerator; invariant; hull; permutation-equivalent codes; support splitting algorithm
Related Items
Unnamed Item, Computing an Invariant of a Linear Code, LESS is More: Code-Based Signatures Without Syndromes, Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes, On Binary Linear Codes Whose Automorphism Group is Trivial, Unnamed Item, A Summary of McEliece-Type Cryptosystems and their Security, Oblivious Transfer Based on the McEliece Assumptions, A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography, On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness, MDS codes with euclidean and Hermitian hulls of flexible dimensions and their applications to EAQECCs, Computing Autotopism Groups of Partial Latin Rectangles, Optimal quaternary linear codes with one-dimensional Hermitian hull and related EAQECCs, On Toeplitz codes of index \(t\) and isometry codes, An improved method for constructing formally self-dual codes with small hulls, On MDS codes with Galois hulls of arbitrary dimensions, New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes, On the computational hardness of the code equivalence problem in cryptography, A new algorithm for equivalence of cyclic codes and its applications, Several classes of Galois self-orthogonal MDS codes and related applications, Galois hulls of constacyclic codes over finite fields, Structural cryptanalysis of McEliece schemes with compact keys, Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\), Semantic security for the McEliece cryptosystem without random oracles, Good integers and some applications in coding theory, The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order, The average dimension of the hull of cyclic codes., LCD codes from tridiagonal Toeplitz matrices, Hulls of cyclic and negacyclic codes over finite fields, Constructions and bounds on quaternary linear codes with Hermitian hull dimension one, Linear codes with one-dimensional hull associated with Gaussian sums, Characteristic vector and weight distribution of a linear code, Optimal binary and ternary linear codes with hull dimension one, Hulls of linear codes revisited with applications, Hermitian hulls of constacyclic codes and a new family of entanglement-assisted quantum MDS codes, Constructions of linear codes with small hulls from association schemes, 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 new method for constructing linear codes with small hulls, Hermitian hulls of constacyclic codes and their applications to quantum codes, LESS-FM: fine-tuning signatures from the code equivalence problem, Structural properties of self-dual monomial codes with application to code-based cryptography, New Galois hulls of generalized Reed-Solomon codes, Practical post-quantum signature schemes from isomorphism problems of trilinear forms, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography, General linear group action on tensors: a candidate for post-quantum cryptography, Hulls of cyclic codes over \(\mathbb{Z}_4\), Galois hulls of linear codes over finite fields, On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes, Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property, Linear codes with small hulls in semi-primitive case, Computational aspects of retrieving a representation of an algebraic geometry code, Hulls of cyclic serial codes over a finite chain ring, An attack on a non-interactive key exchange from code equivalence, Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs, Optimal quaternary Hermitian LCD codes and their related codes, Wild McEliece, Wild McEliece Incognito, On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}, Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes, Quantum Resistant Public Key Encryption Scheme polarRLCE, Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств, McEliece Cryptosystem Implementation: Theory and Practice, A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model, On a Gröbner bases structure associated to linear codes
