Advances In Coding Theory And Cryptography

by Tanush Shaska (Editor), W C Huffman (Editor), D Joyner (Editor)

Overview

In the new era of technology and advanced communications, coding theory and cryptography play a particularly significant role with a huge amount of research being done in both areas. This book presents some of that research, authored by prominent experts in the field.The book contains articles from a variety of topics most of which are from coding theory. Such topics include codes over order domains, Groebner representation of linear codes, Griesmer codes, optical orthogonal codes, lattices and theta functions related to codes, Goppa codes and Tschirnhausen modules, s-extremal codes, automorphisms of codes, etc. There are also papers in cryptography which include articles on extremal graph theory and its applications in cryptography, fast arithmetic on hyperelliptic curves via continued fraction expansions, etc. Researchers working in coding theory and cryptography will find this book an excellent source of information on recent research.

Product Details

ISBN-13:	9789812707017
Publisher:	World Scientific Publishing Company, Incorporated
Publication date:	07/06/2007
Series:	Series On Coding Theory And Cryptology , #3
Pages:	268
Product dimensions:	6.10(w) x 9.10(h) x 0.80(d)

Table of Contents

Preface     v
List of authors     vii
The key equation for codes from order domains   J. B. Little     1
A Grobner representation for linear codes   M. Borges-Quintana   M. A. Borges-Trenard   E. Martinez-Moro     17
Arcs, minihypers, and the classification of three-dimensional Griesmer codes   H. N. Ward     33
Optical orthogonal codes from Singer groups   T. L. Alderson   K. E. Mellinger     51
Codes over F[subscript p superscript 2] lattices, and theta functions   T. Shaska   C. Shor     70
Goppa codes and Tschirnhausen modules   D. Coles   E. Previato     81
Remarks on s-extremal codes   J.-L. Kim     101
Automorphism groups of generalized Reed-Solomon codes   D. Joyner   A. Ksir   W. Traves     114
About the code equivalence   I. G. Bouyukliev     126
Permutation decoding for binary self-dual codes from the graph Q[subscript n] where n is even   J. D. Key   P. Seneviratne     152
The sum-product algorithm on small graphs   M. E. O'Sullivan   J. Brevik   R. Wolski     160
On the extremal graph theory for directedgraphs and its cryptographical applications   V. A. Ustimenko     181
Fast arithmetic on hyperelliptic curves via continued fraction expansions   M. J. Jacobson, Jr.   R. Scheidler   A. Stein     200
The number of inequivalent binary self-orthogonal codes of dimension 6   X.-D. Hou     244