Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures (Q6600001)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures |
scientific article; zbMATH DE number 7908570
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures |
scientific article; zbMATH DE number 7908570 |
Statements
Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures (English)
0 references
6 September 2024
0 references
information theory
0 references
minimum distance
0 references
linear codes
0 references
distributed-memory
0 references
0 references
