Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
From MaRDI portal
Publication:6600001
DOI10.1145/3573383MaRDI QIDQ6600001
Francisco D. Igual, Gregorio Quintana-Ortí, Fernando Hernando
Publication date: 6 September 2024
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Algorithms for the minimum weight of linear codes
- Classification of the extremal formally self-dual even codes of length 30
- A method for efficiently computing the number of codewords of fixed weights in linear codes
- The Magma algebra system. I: The user language
- An error-correcting code framework for genetic sequence analysis
- Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
- How to share a secret
- Searching for linear codes with large minimum distance
- Syndrome-source-coding and its universal generalization
- The intractability of computing the minimum distance of a code
- Linear network coding
This page was built for publication: Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
