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
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, Structural cryptanalysis of McEliece schemes with compact keys, Semantic security for the McEliece cryptosystem without random oracles, The average dimension of the hull of cyclic codes., Hulls of cyclic and negacyclic codes over finite fields, Computational aspects of retrieving a representation of an algebraic geometry code, Wild McEliece, Wild McEliece Incognito, On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}, 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
