Optimal (2, n) visual cryptographic schemes Mausumi BoseRahul Mukerjee OriginalPaper Pages: 255 - 267
The number of transversals in a Latin square Brendan D. McKayJeanette C. McLeodIan M. Wanless OriginalPaper Pages: 269 - 284
On the security of stepwise triangular systems Christopher WolfAn BraekenBart Preneel OriginalPaper Pages: 285 - 302
GOB designs for authentication codes with arbitration Gennian GeYing MiaoL. Zhu OriginalPaper Pages: 303 - 317
On the classification of perfect codes: side class structures Olof HedenMartin Hessler OriginalPaper Pages: 319 - 333
The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q) David G. GlynnJohannes G. MaksRey Casse OriginalPaper Pages: 335 - 341
LDPC codes generated by conics in the classical projective plane Sean V. DromsKeith E. MellingerChris Meyer OriginalPaper Pages: 343 - 356
Fast decoding of quasi-perfect Lee distance codes Peter HorakBader F. AlBdaiwi OriginalPaper Pages: 357 - 367
On the k-error linear complexity over \(\mathbb{F}_p\) of Legendre and Sidelnikov sequences Hassan AlyArne Winterhof OriginalPaper Pages: 369 - 374