A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields (Q2254537): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Codes Which Detect Deception / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authentication Theory/Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message Authentication with Arbitration of Transmitter/Receiver Disputes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2846651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2918620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic bounds for authentication codes and block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multireceiver authentication codes: Models, bounds, constructions, and extensions / rank
 
Normal rank

Revision as of 15:33, 9 July 2024

scientific article
Language Label Description Also known as
English
A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
scientific article

    Statements

    A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2015
    0 references
    optimal multi-sender authentication code
    0 references
    singular pseudo-symplectic geometry
    0 references
    finite fields
    0 references

    Identifiers