A new algorithm for finding minimum-weight words in large linear codes (Q4608514): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: McEliece / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-60693-9_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1574541063 / rank
 
Normal rank
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 08: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