default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 2, 1992
Volume 2, Number 1, March 1992
- Tomik Yaghoobian, Ian F. Blake:
Hermitian Codes as Generalized Reed-Solomon Codes. 5-17 - Jonathan Jedwab:
Generalized Perfect Arrays and {Menon} Difference Sets. 19-68 - Bhaskar Bagchi:
On Quasi-Symmetric Designs. 69-79 - Phil P. Greenough, Ray Hill:
Optimal Ternary Quasi-Cyclic Codes. 81-91 - Jonathan Jedwab, Sheelagh Lloyd:
A Note on the Nonexistence of Barker Sequences. 93-97
Volume 2, Number 2, June 1992
- Whitfield Diffie, Paul C. van Oorschot
, Michael J. Wiener:
Authentication and Authenticated Key Exchanges. 107-125 - Edward Spence:
A Complete Classification of Symmetric (31, 10, 3) Designs. 127-136 - Ray Hill, David Ellis Newton:
Optimal Ternary Linear Codes. 137-157 - Darryn E. Bryant:
Varieties of Quasigroups Arising from 2-Perfect m-Cycle Systems. 159-168 - Stephen D. Cohen:
The Explicit Construction of Irreducible Polynomials over Finite Fields. 169-174 - Douglas R. Stinson:
Combinatorial Characterizations of Authentication Codes. 175-187 - Aart Blokhuis, A. Robert Calderbank:
Quasi-Symmetric Designs and the Smith Normal Form. 189-206
Volume 2, Number 3, September 1992
- Xiang-dong Hou:
Some Inequalities about the Covering Radius of Reed-Muller Codes. 215-224 - Noboru Hamada, Tor Helleseth, Øyvind Ytrehus:
On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound. 225-229 - Michael R. Fellows, Neal Koblitz:
Self-Witnessing Polynomial-Time Complexity and Prime Factorization. 231-235 - Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, Vladimir D. Tonchev:
Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. 237-251 - Ronald Shaw:
A Characterization of the Primals in PG(m, 2). 253-256 - K. T. Arasu, Qing Xiang:
On the Existence of Periodic Complementary Binary Sequences. 257-262 - Alexander Pott:
On Abelian Difference Set Codes. 263-271 - Peter Landrock, Olaf Manz:
Classical Codes as Ideals in Group Algebras. 273-285 - Thomas Beth, Volker Hatz:
Design Machines: Algebraically Well Described Interconnection Networks. 287-298
Volume 2, Number 4, December 1992
- Nicola Melone, Udo Ott:
On the Rank of Truncated Incidence Matrices of Linear Spaces. 307-313 - Shuhong Gao, Hendrik W. Lenstra Jr.:
Optimal Normal Bases. 315-323 - Wen-Ai Jackson, Peter R. Wild:
Relations between Two Perfect Ternary Sequence Constructions. 325-332 - Zhe-xian Wan:
Construction of Cartesian Authentication Codes from Unitary Geometry. 333-356 - Douglas R. Stinson:
An Explication of Secret Sharing Schemes. 357-390 - D. de Caen, Chris D. Godsil, Gordon F. Royle:
On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott. 391-394 - Bernhard Schmidt:
Note on a Question by S. Bagchi and B. Bagchi. 395
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-31 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
