Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Combinatorial algorithms : generation, enumeration and search (1999)
    Boca Raton u.a. :CRC Press,
    Details
    Title: Combinatorial algorithms : generation, enumeration and search
    Author: Kreher, Donald L.
    Contributer: Stinson, Douglas R.
    Publisher: Boca Raton u.a. :CRC Press,
    Year of publication: 1999
    Pages: 329 S.
    Series Statement: Discrete mathematics and applications
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 2
    Book
    Book
    Contemporary design theory: a collection of surveys (1992)
    New York u.a. :Wiley,
    Details
    Title: Contemporary design theory: a collection of surveys
    Contributer: Dinitz, Jeffrey H. , Stinson, Douglas R.
    Publisher: New York u.a. :Wiley,
    Year of publication: 1992
    Pages: 639 S.
    Series Statement: Wiley-Interscience series in discrete mathematics and optimization
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 3
    Electronic Resource
    Electronic Resource
    New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes (1998)
    Springer
    Designs, codes and cryptography 15 (1998), S. 87-100 
    Details
    ISSN: 1573-7586
    Keywords: Cryptography ; Authentication Code ; Key predistribution scheme ; Bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS). We first prove a new lower bound on the number of keys in an A-code without secrecy, which can be thought of as a generalization of the classical Rao bound for orthogonal arrays. We also prove a new lower bound on the number of keys in a general A-code, which is based on the Petrenjuk, Ray-Chaudhuri and Wilson bound for t-designs. We also present new lower bounds on the size of keys and the amount of users' secret information in KPS, the latter of which is accomplished by showing that a certain A-code is “hiding” inside any KPS.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008229625895
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Combinatorial characterizations of authentication codes II (1996)
    Springer
    Designs, codes and cryptography 7 (1996), S. 239-259 
    Details
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For any authentication code for k source states and v messages having minimum possible deception probabilities (namely, % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaacaWGqbWaaS% baaSqaaiaadsgaaeqaaOWaaSbaaSqaaiaaicdaaeqaaOGaeyypa0Za% aSGbaeaacaWGRbaabaGaamODaaaaaaa!3F28!\[P_d _0 = {k \mathord{\left/ {\vphantom {k v}} \right. \kern-\nulldelimiterspace} v}\] and % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaacaWGqbWaaS% baaSqaaiaadsgaaeqaaOWaaSbaaSqaaiaaigdaaeqaaOGaeyypa0Ze% xLMBb50ujbqeguuDJXwAKbacfaGae8hkaGIaam4AaiabgkHiTiaaig% dacqWFPaqkcqWFVaWlcqWFOaakcqWF2bGDcqGHsislcaaIXaGae8xk% aKIae8xkaKcaaa!4CD1!\[P_d _1 = (k - 1)/(v - 1))\], we show that there must be at least v encoding rules. (This can be thought of as an authentication-code analogue of Fisher's Inequality.) We derive several properties that an extremal code must satisfy, and we characterize the extremal codes for equiprobable source states as arising from symmetric balanced incomplete block designs. We also present an infinite class of extremal codes, in which the source states are not equiprobable, derived from affine planes.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00124515
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Edge-coloured designs with block size four (1988)
    Springer
    Aequationes mathematicae 36 (1988), S. 230-245 
    Details
    ISSN: 1420-8903
    Keywords: Primary 05B30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The existence of edge-coloured block designs with block size four is studied for all nonisomorphic colourings of the edges of aK 4. There are 25 nonisomorphic edge-colouredK 4's; for each, we examine the existence of edge-coloured designs with the minimum possible index. Uniform cases lead to block designs, perpendicular arrays, nested Steiner triple systems, idempotent Schroeder quasigroups, and other combinatorial objects.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01836093
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Combinatorial Characterizations of Authentication Codes II (1996)
    Springer
    Designs, codes and cryptography 7 (1996), S. 239-259 
    Details
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For any authentication code for k source states and v messages having minimum possible deception probabilities (namely, Pd0 = k/v and Pd1 = (k - 1)/(v - 1)), we show that there must be at least v encoding rules. (This can be thought of as an authentication-code analogue of Fisher's Inequality.) We derive several properties that an extremal code must satisfy, and we characterize the extremal codes for equiprobable source states as arising from symmetric balanced incomplete block designs. We also present an infinite class of extremal codes, in which the source states are not equiprobable, derived from affine planes.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018094824862
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...