default search action
Designs, Codes and Cryptography, Volume 76
Volume 76, Number 1, July 2015
- Ilias S. Kotsireas, Edgar Martínez-Moro
:
Foreword: Computer Algebra in Coding Theory and Cryptography. 1-2 - Mercè Villanueva
Efficient representation of binary nonlinear codes: constructions and minimum distance computation. 3-21 - Natalia Dück, Karl-Heinz Zimmermann:
Heuristic decoding of linear codes using commutative algebra. 23-35 - Tom Høholdt, Fernando Piñero, Peng Zeng:
Optimal codes as Tanner codes with cyclic component codes. 37-47 - Olav Geil
An improvement of the Feng-Rao bound for primary codes. 49-79 - Wilson Olaya-León, Claudia Granados-Pinzón:
The second generalized Hamming weight of certain Castle codes. 81-87 - Carlos Galindo
Quantum codes from affine variety codes and their subfield-subcodes. 89-100 - Carlos Munuera
Hamming codes for wet paper steganography. 101-111 - Thomas W. Cusick, Bryan Johns:
Theory of 2-rotation symmetric cubic Boolean functions. 113-133
Volume 76, Number 2, August 2015
- Mauro Biliotti
2-(v, k, 1) Designs with a point-primitive rank 3 automorphism group of affine type. 135-171 - Ferruh Özbudak
On some bounds on the minimum distance of cyclic codes over finite fields. 173-178 - Jooyoung Lee, Martijn Stam:
MJH: a faster alternative to MDC-2. 179-205 - Tamás Héger
Search problems in vector spaces. 207-216 - Tony Shaska
Theta functions and symmetric weight enumerators for codes over imaginary quadratic fields. 217-235 - Darcy Best, Hadi Kharaghani, Hugh Ramp:
Mutually unbiased weighing matrices. 237-256 - Edward Dobson:
Monomial isomorphisms of cyclic codes. 257-267 - José Joaquín Bernal
Permutation decoding of ℤ2ℤ4-linear codes. 269-277 - Jiao Li, Claude Carlet, Xiangyong Zeng, Chunlei Li, Lei Hu, Jinyong Shan
Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks. 279-305 - Eric Zhi Chen:
A new iterative computer search algorithm for good quasi-twisted codes. 307-323 - Thomas Plantard
LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme. 325-344 - Sihuang Hu
New pseudo-planar binomials in characteristic two and related schemes. 345-360 - Yuan-Hsun Lo
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes. 361-372
Volume 76, Number 3, September 2015
- Masaaki Harada:
On a 5-design related to a putative extremal doubly even self-dual code of length a multiple of 24. 373-384 - Guo-qiang Liu, Chen-Hui Jin:
Differential cryptanalysis of PRESENT-like cipher. 385-408 - Bangteng Xu:
Bentness and nonlinearity of functions on finite groups. 409-430 - Orr Dunkelman, Nathan Keller, Adi Shamir:
Almost universal forgery attacks on AES-based MAC's. 431-449 - Susan G. Barwick
An investigation of the tangent splash of a subplane of PG(2, q3). 451-468 - Atsushi Fujioka
Strongly secure authenticated key exchange from factoring, codes, and lattices. 469-504 - Tung Le, Jamshid Moori:
On the automorphisms of designs constructed from finite simple groups. 505-517 - Steven T. Dougherty, Jon-Lark Kim, Yoonjin Lee
Codes over rings and Hermitian lattices. 519-535 - Oktay Olmez:
Plateaued functions and one-and-half difference sets. 537-549 - Anthony B. Evans, David Fear, Rebecca J. Stones:
Diagonally cyclic equitable rectangles. 551-569 - Claude Carlet, Deng Tang
Enhanced Boolean functions suitable for the filter model of pseudo-random generator. 571-587 - Hengjia Wei, Hui Zhang, Gennian Ge:
Completely reducible super-simple designs with block size five and index two. 589-600 - Orr Dunkelman, Nathan Keller:
Practical-time attacks against reduced variants of MISTY1. 601-627
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 2024-11-15 19:22 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: