Some new constructions of authentication codes with arbitration and multi-receiver from singular symplectic geometry (Q410815): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58690490, #quickstatements; #temporary_batch_1705514146057
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1155/2011/675484 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987462343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Cartesian authentication codes from unitary geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4698439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3641699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of authentication codes with arbitration from unitary geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multireceiver authentication codes: Models, bounds, constructions, and extensions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Some new constructions of authentication codes with arbitration and multi-receiver from singular symplectic geometry
scientific article

    Statements

    Some new constructions of authentication codes with arbitration and multi-receiver from singular symplectic geometry (English)
    0 references
    0 references
    0 references
    4 April 2012
    0 references
    Summary: A new construction of authentication codes with arbitration and multireceiver from singular symplectic geometry over finite fields is given. The parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of deception are also computed.
    0 references

    Identifiers