A Graph-Theoretical Method for Decoding Some Group MLD-Codes (Q5090151): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5595945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public-key cryptosystem based on binary Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective attack on the McEliece cryptosystem based on Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-independence number and edge-covering number for regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of the Sidelnikov Cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of a class of majority-logic decodable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5340151 / rank
 
Normal rank

Revision as of 15:14, 29 July 2024

scientific article; zbMATH DE number 7558113
Language Label Description Also known as
English
A Graph-Theoretical Method for Decoding Some Group MLD-Codes
scientific article; zbMATH DE number 7558113

    Statements

    Identifiers