General Information Research Interests People Publications Communications Research Group Department of Electronics and Computer Science University of Southampton Highfield, Southampton SO17 1BJ, United Kingdom Tel. +44 (0) 23 8059 3782 Fax +44 (0)23 8059 4508 e-mail: dh@ecs.soton.ac.uk ...

Yves Edel's home page Mathematical Interests My interest is in Discrete Mathematics and its interactions with Geometry, Cryptology and Algorithms. Caps Check- or generator matrices of some linear codes Some constant weight codes Some good quantum twisted codes OOA and tms-nets List of publications Links Address: Mathematisches Institut der Universitat Im Neuenheimer Feld 288 69120 Heidelberg ...

Space probes, like NASA's recent Pathfinder mission to Mars, have radio transmitters of only a few watts, but have to transmit pictures and scientific data across hundreds of millions of miles without the information being completely swamped by noise. Read about how coding theory helps. ...

Communications Systems and Research Section, JPL Information Processing Group Welcome to our homepage on turbo codes! Overview of turbo codes Performance of turbo codes Publications on turbo codes DSP and FPGA turbo decoders Database of commercially available turbo code products Code imperfectness (Submission of new results) Related Web Resources Caltech Communications Group California ...

Coding Research Group University Of Notre Dame PEOPLE PUBLICATIONS LINKS HOME The coding research group works in the area of digital communications with special emphasis on information theory, coding theory and coded modulation. Particular projects include the development of turbo and low density parity check coding techniques for reliable communication at rates near channel capacity, iterative ...

Juergen Bierbrauer's home page I am Professor of Mathematics in the Department of Mathematical Sciences at Michigan Technological University . My address, phone and fax number are given below. Mathematical Interests My interest is in Discrete Mathematics and its interactions with Geometry, Cryptology and Algorithms. Coding Theory and Applications New codes via the lengthening of BCH codes with ...

Coding Theory Group Welcome to the home page for the Coding Theory Group at the Department of Mathematics of University of Turku. The group is part of the Turku Centre for Computer Science (TUCS). Assume that information is sent from a source over a noisy channel to a receiver. A fundamental problem of coding theory is to determine what message was sent on the basis of the approximation that was ...

Prochaines conferences Deadlines 15 juillet 2002 EQIS'02 (ERATO Worshop on Quantum Information Science) Tokyo, Japon, 6-8 septembre 2002. deadline pour les posters: 30 juillet 2002. 7 aout 2002 Indocrypt 2002 Hyderabad, Inde, 16-18 decembre 2002. 9 aout 2002 PKC 2003 Miami, USA, 6-8 janvier 2003. acceptation: 27 septembre 2002. 30 septembre 2002 Numero special de la Revue TSI sur la securite ...

Math 4410/5410 - Coding Theory and Cryptology Index Introduction Course Syllabus -Spring 2000 Lecture Notes Bibliography Supplementary Materials Textbook Errata Homework Assignments (with answers) Exams (with answers) Course Statistics (Spring 1998) Class Announcements (Spring 2000) Special Links Policies Talk to the Prof! Doug Stinson's Cryptography Page This page also exists in a frames ...

Reed-Solomon codes information source. Everything you ever wanted to know about Reed-Solomon error correction codes from 4i2i.

The Ubiquitous Reed-Solomon Codes Barry Cipra SIAM News, Vol. 26, No. 1, January 1993 In this so-called Age of Information, no one need be reminded of the importance not only of speed but also of accuracy in the storage, retrieval, and transmission of data. It's more than a question of Garbage In, Garbage Out. Machines do make errors, and their non-man-made mistakes can turn otherwise flawless ...

Encoding/Decoding Reed Solomon Codes ...

AAECC/IRIT Lab Applied Algebra and Error Correcting Codes AAECC/IRIT : is a research team under the responsability of Professor Alain Poli, Docteur d'Etat es Mathematiques (1978). The team has 4 members : Emmanuelle Delpeyroux, Marie-Claude Gennero, Jerome Lacan, Alain Poli. Domains of Activity Our domains of activity are : contracts with industry (18 from 1981 until now), publications in ...

Error Control Coding, Error CorrectingCoding, Error Correcting Codes, FEC, Turbo Codes, Iterative Decoding, DigitalCommunications, Wireless, Satellite, Data, Coded Modulation, Golay, Hamming, BCH, Reed Solomon, Viterbi Decoder, Soft Decision Decoding, Sudan Algorithm, Unequal Error Protection, Variable Rate Coding, Adaptive Coding, Convolutional Codes, LDPC, Low-Density Parity-Check Codes, The Art of Error-Correcting ...

Notes on Coding Theory -- J.I. Hall These notes are not intended for broad distribution. If you want to use them in any way, please contact me. To see various of the subscripts or superscripts properly, you may need to increase magnification or print out the appropriate pages. Title Page; Preface; Table of Contents (in .pdf) Chapter 1. Introduction (in .pdf) Chapter 2. Sphere Packing and ...

A Library of Linear (and Nonlinear) Codes N. J. A. Sloane Keywords: BCH codes, Best codes, binary codes, Cheng-Sloane codes, codes over GF(2), GF(3), GF(4), constant weight codes, Conway-Pless codes, Golay codes, Kschischang-Pasupathy codes, Nordstrom-Robinson code, linear codes, nonlinear codes, quantum codes, quaternary codes, Reed-Muller codes, Steiner systems, ternary codes, A library of ...

Turbo/MAP Codec I've built a flexible turbo/MAP codec. codec.jpg is the 6U high 48 cm rack containing from left to right, the encoder/interface card, turbo/MAP decoder 1, interleaver address delay card 1, turbo/MAP decoders 2 to 5, interleaver address delay card 2, and turbo/MAP decoders 6 and 7. An additional 11 turbo/MAP decoder cards can fit within the rack to give a total of 18 iterations.

Coding Theorists J.M. Aarts TU Delft E. F. Assmus, Jr. Lehigh University Jurgen Bierbrauer Michigan Technological University Richard Blahut U of Illinois Martin Bossert University of Ulm Iliya Bouyukliev Bulgarian Academy of Sciences Andries E. Brouwer TU Eindhoven Robert A. Calderbank AT&T Labs-Research Zhi Chen HKr, Sweden Steven T. Dougherty University of Scranton Patrick Fitzpatrick ...

NATIONAL SCIENCE FOUNDATION 4201 WILSON BOULEVARD ARLINGTON, VIRGINIA 22230 Report of the Working Group on Cryptology and Coding Theory National Science Foundation, April 17-18, 1997 October 14, 1997 Dear Colleague: The increase in computer power and connectivity has changed the face of science and engineering, just as it has generated new opportunities for all Americans. We are entering an era ...

Theory of Codes Mise jour du 10 mai 1996 Le livre Le livre, paru en 1985, sera bient t epuise. D'autre part, la theorie a fait des progr s substantiels depuis la date de parution. C'est pourquoi nous mettons en chantier une nouvelle edition qui, dans un premier temps, sera disponible sur le reseau. Le manuscrit Dans une premi re etape, le manuscrit de Theory of Codes 1985 a ete saisi, puis mis ...

DESIGNS AND THEIR CODES E. F. Assmus, Jr and J. D. Key Preface to the Second Printing The aim of this book is to study applications of algebraic coding theory to the analysis and classification of designs. Designs are usually classified by their parameter sets, by their inclusion in infinite families, or according to the type of automorphism group they admit --- or in other ways related to their ...

Check- or generator matrices of some linear codes I give here check- or generator matrices of some linear codes. Most of these codes were found by computer search. Codes cited in older papers, whose parameters are implied by other codes given here, are set italic. Look at caps for codes with distance 4. Check- or generator matrices of some linear binary codes Check- or generator matrices of some ...

N. J. A. Sloane: Papers on coding theory (excluding codes for quantum computers, codes over Z4, covering radius of codes, quantizing) Restrictions on Weight Distribution of Reed-Muller Codes, E. R. Berlekamp and N. J. A. Sloane, Information and Control, 14 (1969), pp. 442-456. The Weight Enumerator for Second-Order Reed-Muller Codes, N. J. A. Sloane and E. R. Berlekamp, IEEE Trans. Information ...

Error-Correcting Code Bibliography (10/12/2001) Prepared by: Joseph Malkevitch Mathematics and Computing Department York College (CUNY) Jamaica, New York 11451-0001 Email: joeyc@cunyvm.cuny.edu (for additions, suggestions, and corrections) Abramson, N., Information and Coding, McGraw Hill, New York, 1963. Berlekamp, E., Algebraic Coding Theory, McGraw-Hill, New York, l968. Berlekamp, E., (ed.), ...

This web site was created for FREE at www.homestead.com. Visit www.homestead.com to get your free web site - no programming required.

Codes database ...

Alex Vinokur's Site Guestbook Name: Email: (Optional) HomePage: (Optional) Where are you from: (Optional) Your message: &nbsp Thanks! &nbsp Message Board Visitors : since May 09, 2001 ...

Dense sphere packings from new codes coauthor Jurgen Bierbrauer Journal of Algebraic Combinatorics, 11 (2000), 95-100. Abstract: The idea behind the coset code construction is to reduce the construction of sphere packings to error-correcting codes in a unified way. We give here a short self-contained description of this method. In recent papers we constructed a large number of new binary, ...

Lower Bounds and Encoding Circuits for Weakly Self-dual CSS Codes Codes up to length 32 encoding up to 30 qubits n\k 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 k/n 2 2 2 3 - 1 3 4 2 - 2 4 5 - 1 - 1 5 6 2 - 2 - 2 6 7 - 3 - 1 - 1 7 8 4 - 2 - 2 - 2 8 9 - 3 - 2 - 1 - 1 9 10 2 - 2 - 2 - 2 - 2 10 11 - 3 - 2 - 2 - 1 - 1 11 12 4 - 3 - 2 - 2 - 2 - 2 12 13 - 3 - 2 - ...

Last modified on August 23, 1999 Table of the best currently known lower and upper bounds on the smallest size of a covering code Below we present tables with the best known bounds on the size of binary covering codes of length up to 33 and covering radius up to 10. The table is based on Table 6.1 from G.Cohen, I.Honkala, S.Litsyn, A.Lobstein Covering Codes , Elsevier, 1997. Please send any ...

Turbo Code Sites Turbo Codes Home Page Virginia Tech Turbo Codes Homepage JPL Turbo Codes Home Page Politecnico di Torino Turbo Codes Home Page Lehrstuhl fur Nachrichtentechnik, Technische Universitat Munchen, Germany Digital Communications Group, Lehrstuhl fur Nachrichtentechnik (LNT), Universitat Erlangen-Nurnberg, Germany Departement Electronique, Telicom Bretagne, France Center for Satellite ...

Basic procedures for Cyclic, Hamming, Binary Reed-Muller, BCH, and Golay codes We construct the parity-check matrix and generator matrix of the cyclic code of length n over GF(p), the Hamming code over GF(p), the binary 1st order Reed-Muller code (which is length n=2m, dimension m+1, minimum distance 2m-1), the ternary (11, 6)-Golay (which is perfect, minimum distance 5, and 2-error-correcting), ...

Isometry classes of codes Harald Fripertinger These pages serve as additional information to the following publications: A. BETTEN, H. FRIPERTINGER, A. KERBER, A. WASSERMANN, K.-H. ZIMMERMANN: Codierungstheorie: Konstruktion und Anwendung linearer Codes, Springer, Berlin, Heidelberg, New York, 1998. ISBN 3-540-64502-0.. HARALD FRIPERTINGER, ADALBERT KERBER: Isometry Classes of Indecomposable ...