A new algorithm for finding minimum-weight words in large linear codes (Q4608514): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4365734 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3803024 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A probabilistic algorithm for computing minimum weights of large error-correcting codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3752293 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative decoding of linear codes by a modulo-2 linear program / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3835408 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new identification scheme based on syndrome decoding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3202943 / rank | |||
Normal rank |
Latest revision as of 07:59, 15 July 2024
scientific article; zbMATH DE number 6851584
Language | Label | Description | Also known as |
---|---|---|---|
English | A new algorithm for finding minimum-weight words in large linear codes |
scientific article; zbMATH DE number 6851584 |
Statements
A new algorithm for finding minimum-weight words in large linear codes (English)
0 references
21 March 2018
0 references
0 references