Abstract is missing.
- Crypto applications of combinatorial group theoryIvana Ilic, Spyros S. Magliveras. 1-16 [doi]
- Generating rooted trees of m nodes uniformly at randomKenneth Matheis, Spyros S. Magliveras. 17-26 [doi]
- On Jacobsthal Binary SequencesSpyros S. Magliveras, Tran van Trung, Wandi Wei. 27-37 [doi]
- Applications of finite geometry in coding theory and cryptographyAndreas Klein, Leo Storme. 38-58 [doi]
- The arithmetic of genus two curvesTony Shaska, L. Beshaj. 59-98 [doi]
- Covering arrays and hash familiesCharles J. Colbourn. 99-135 [doi]
- Sequences and arrays with desirable correlation propertiesK. T. Arasu. 136-171 [doi]
- Permutation decoding for codes from designs, finite geometries and graphsJ. D. Key. 172-201 [doi]
- Finite Groups, Designs and CodesJamshid Moori. 202-230 [doi]
- Designs, strongly regular graphs and codes constructed from some primitive groupsDean Crnkovic, Vedrana Mikulic Crnkovic, B. G. Rodrigues. 231-252 [doi]
- Matrices for graphs, designs and codesWillem H. Haemers. 253-277 [doi]
- Finding error-correcting codes using computersClement W. H. Lam. 278-284 [doi]
- Quantum jump codes and related combinatorial designsMasakazu Jimbo, Keisuke Shiromoto. 285-311 [doi]
- Unbiased Hadamard matrices and basesHadi Kharaghani. 312-325 [doi]
- Multi-structured designs and their applicationsRyoh Fuji-Hara, Ying Miao. 326-362 [doi]
- Recent results on families of symmetric designs and non-embeddable quasi-residual designsMohan S. Shrikhande, Tariq A. Alraqad. 363-403 [doi]
- Codes and modules associated with designs and t-uniform hypergraphsRichard M. Wilson. 404-436 [doi]
- Finite geometry designs, codes, and Hamada's conjectureVladimir D. Tonchev. 437-448 [doi]