Information, Coding and Mathematics: Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday

379 Pages·2002·14.024 MB·English

by  Pierre Baldi (auth.), Mario Blaum, Patrick G. Farrell, Henk C. A. van Tilborg (eds.)

INFORMATION, CODING
AND MATHEMATICS
THE KLUWER INTERNATIONAL SERIES
IN ENGINEERING AND COMPUTER SCIENCE
COMMUNICATIONS AND INFORMATION THEORY
Consulting Editor
Robert Gallager
Other books in the series:
CODES, GRAPHS, AND SYSTEMS, edited by Richard E. Blahut and RalfKoetter,
ISBN: 0-7923-7686-2
CODES, CURVES AND SIGNALS: Common Threads in Communications, edited by Alexander
Vardy; ISBN: 0-7923-8374-5
PERSPECTIVES IN SPREAD SPECTRUM, Amer A. Hassan, John E. Hershey, and Gary 1.
Saulnier; ISBN: 0-7923-8265-X
WIRELESS PERSONAL COMMUNICATIONS: Advances in Coverage and Capacity, Jeffrey H.
Reed, Theodore S. Rappaport, Brian D. Woerner; ISBN: 0-7923-9788-6
ASYMPTOTIC COMBINATORIAL CODING THEORY, Volodia Blinovsky;
ISBN: 0-7923-9988-9
PERSONAL AND WIRELESS COMMUNICATIONS: Digital Technology and Standards, Kun II
Park; ISBN: 0-7923-9727-4
WIRELESS INFORMATION NETWORKS: Architecture, Resource Managment, and Mobile Datil,
Jack M. Holtzman; ISBN: 0-7923-9694-4
DIGITAL IMAGE COMPRESSION: Algorithms and Standards, W.eidong Kou;
ISBN: 0-7923-9626-X
CONTROL AND PERFORMANCE IN PACKET, CIRCUIT, AND ATM NETWORKS, XueDao
Gu, Kazem Sohraby and Dhadesugoor R. Vaman; ISBN: 0-7923-9625-1
DISCRETE STOCHASTIC PROCESSES, Robert G. Gallager; ISBN: 0-7923-9583-2
WIRELESS PERSONAL COMMUNICATIONS: Research Developments, Brian D. Woerner,
Theodore S. Rappaport and Jeffrey H. Reed; ISBN: 0-7923-9555-7
PLANNING AND ARCHITECTURAL DESIGN OF INTEGRATED SERVICES DIGITAL
NETWORKS, A. Nejat Ince, Dag Wilhelmsen and Biilent Sankur; ISBN: 0-7923-9554-9
WIRELESS INFRARED COMMUNICATIONS, John R. Barry; ISBN: 0-7923-9476-3
COMMUNICATIONS AND CRYPTOGRAPHY: Two sides of One Tapestry, Richard E. Blahut,
Daniel 1. Costello, Jr., Veli Maurer and Thomas Mittelholzer; ISBN: 0-7923-9469-0
WIRELESS AND MOBILE COMMUNICATIONS, Jack M. Holtzman and David 1. Goodman;
ISBN: 0-7923-9464-X
INTRODUCTION TO CONVOLUTIONAL CODES WITH APPLICATIONS, Ajay Dholakia;
ISBN: 0-7923-9467-4
CODED-MODULATION TECHNIQUES FOR FADING CHANNELS, S. Hamidreza Jamali, and
Tho Le-Ngoc; ISBN: 0-7923-9421-6
WIRELESS PERSONAL COMMUNICATIONS: Trends and Challenges, Theodore S. Rappaport,
Brian D. Woerner, Jeffrey H. Reed; ISBN: 0-7923-9430-5
ELLIPTIC CURVE PUBLIC KEY CRYPTOSYSTEMS, Alfred Menezes; ISBN: 0-7923-9368-6
SATELLITE COMMUNICATIONS: Mobile and Fixed Services, Michael Miller, Branka Vucetic
and Les Berry; ISBN: 0-7923-9333-3
WIRELESS COMMUNICATIONS: Future Directions, Jack M. Holtzman and David 1. Goodman;
ISBN: 0-7923-9316-3
DISCRETE-TIME MODELS FOR COMMUNICATION SYSTEMS INCLUDING ATM, Herwig
Bruneel and Byung G. Kim; ISBN: 0-7923-9292-2
APPLICATIONS OF FINITE FIELDS, Alfred J. Menezes, Ian F. Blake, XuHong Gao, Ronald C.
Mullin, Scott A. Vanstone, Tomik Yaghoobian; ISBN: 0-7923-9282-5
WIRELESS PERSONAL COMMUNICATIONS, Martin 1. Feuerstein, Theodore S. Rappaport;
ISBN: 0-7923-9280-9
SEQUENCE DETECTION FOR HIGH-DENSITY STORAGE CHANNEL, Jaekyun Moon, L.
Richard Carley; ISBN: 0-7923-9264-7
DIGITAL SATELLITE COMMUNICATIONS SYSTEMS AND TECHNOLOGIES: Military and
Civil Applications, A. Nejat Ince; ISBN: 0-7923-9254-X
IMAGE AND TEXT COMPRESSION, James A. Storer; ISBN: 0-7923-9243-4
VECTOR OUANTlZAT ION AND SIGNAL COMPRESSION. Allen Gersho. Robert M. Grav:
INFORMATION, CODING
and MATHEMATICS
Proceedings of Workshop honoring
Prof. Bob McEliece on his 60th birthday
edited by
Mario Blaum
IBM Research Division
Patrick G. Farrell
Lancaster University
Henk C. A. van Tilborg
Eindhoven University of Technology
~.
"
Springer Science+Business Media, LLC
....
" Electronic Services <http://www.wkap.nl>
Library of Congress Cataloging-in-Publication Data
A C.I.P. Catalogue record for this book is available
from the Library of Congress.
ISBN 978-1-4419-5289-9 ISBN 978-1-4757-3585-7 (eBook)
DOI 10.1007/978-1-4757-3585-7
Copyright © 2002 by Springer Science+Business Media New York
Originally published by Kluwer Academic Publishers in 2002
Softcover reprint of the hardcover 1s t edition 2002
All rights reserved. No part of this work may be reproduced, stored in a
retrieval system, or transmitted in any form or by any means, electronic,
mechanical, photocopying, microfilming, recording, or otherwise, without the
written permission from the Publisher, with the exception of any material
supplied specifically for the purpose of being entered and executed on a
computer system, for exclusive use by the purchaser of the work.
Permission for books published in Europe: [email protected]
Permissions for books published in the United States of America:
[email protected]
Printed on acid-free paper.
Robert J. McEliece
TABLE OF CONTENTS
Preface .......................................................... IX
1. A Computational Theory of Surprise
Pierre Baldi .................................................... 1
2. Dynamic Key Distribution Using MDS Codes
Lihao Xu ..................................................... 27
3. Worst-Case Mutual Information Trajectories in Concate
nated Codes with Asymptotic Interleavers
Dariush Divsalar and Shlomo Shamai ......................... 45
4. Results to get Maximal Quasihermitian Curves. New pos
sibilities for AG Codes
Robert J. McEliece and Mari Cruz Rodriguez-Palanquex ...... 55
5. On Asymmetric Error Detection with Feedback
Paul Oprisan and Bella Bose .................................. 63
6. Cryptanalysis of Block Ciphers and Weight Divisibility of
Some Binary Codes
Anne Canteaut, Pascale Charpin and Marion Videau .......... 75
7. Sloppy Alice attacks! Adaptive chosen ciphertext attacks
on the McEliece Public-Key Cryptosystem
Eric R. Verheul, Jeroen M. Doumen and
Henk C. A. van Tilborg ....................................... 99
8. Reducible Rank Codes and Applications to Cryptography
Ernst M. Gabidulin, Alexei Ourivski, Bassem Ammar and
Bahram Honary .............................................. 121
9. On a Boolean Maximization Problem
Solomon W. Golomb and Wensong Chu ...................... 133
10. On the Security of the McEliece Public-Key Cryptosystem
Nicolas Sendrier .............................................. 141
11. Performance of MIMO Space Time-Coding with Discrete
Modulations
Jung-Fu (Thomas) Chen ..................................... 165
12. Coding for Slow-Frequency-Hop Transmission: Variations
on a Theme of McEliece
Thomas G. Macdonald and Michael B. Pursley ............... 183
13. On Graph Constructions for LDPC Codes by Quasi-Cyclic
Extension
R. Michael Tanner ........................................... 209
14. On the Channel Memory-Diversity Tradeoff in Communi
cation Systems
Andrew P. Worthen and Wayne E. Stark ..................... 221
15. Duality, Dirty Paper Coding, and Capacity for Multiuser
Wireless Channels
Nihar Jindal, Sriram Vishwanath and Andrea Goldsmith ..... 239
16. Stability Analysis of the Turbo Decoding Algorithm Using
Max-Log-MAP
Wei-Sheng Wu, Chung-Hsuan Wang, Mao-Ching Chiu and
Chi-chao Chao ............................................... 257
17. Recursive List Decoding for Reed-Muller Codes and their
Subcodes
Ilya Dumer and Kirill Shabunov .............................. 279
18. Adaptive Soft-Decision Decoding In Two Dimensions
Xiao-Hong Peng, Paddy G. Farrell and Paul Coulton ......... 299
19. On the Theory of Linear Trellises
Ralf Koetter and Alex Vardy ................................. 323
20. Coding Over Graphs
Anxiao (Andrew) Jiang and Jehoshua Bruck ................. 355
21. On Approaching the Capacity of Finite-State Intersymbol
Interference Channels
Joseph B. Soriaga, Henry D. Pfister and Paul H. Siegel ....... 365
Preface
These Proceedings contain 21 papers that were presented at the Work
shop celebrating Prof. Bob McEliece's 60th birthday at Caltech on May
24th and 25th, 2002.
Bob has had a tremendous influence in different fields of information
theory. He has worked in all aspects of coding, block codes, bounds,
convolutional codes, turbo codes. He has obtained important results in
cryptography and Shannon Theory. As a tribute to his achievements, I
am proud to present the 21 papers that integrate this volume, which are
related to different aspects of Bob's work. I will not summarize to the
reader the contents of each of these papers. The authors themselves make
an excellent case by showing Bob's influence in their results. Just let me
say that when I was editing the book, I felt like reading immediately
some of the papers. I did not have the time to go into them in detail
(otherwise, you would not be reading this Preface), but eventually I will.
I am sure that the reader will share my enthusiasm for those papers on
his or her favorite topic.
Describing Bob's professional achievements could take forever, and
those are well known. He is being honored by much more than techni
cal excellence, though. He is one of the most beloved members of our
Information Theory community. He is known for selflessly sharing his
knowledge with everybody. Bob is always moved by a sense of curiosity.
At 60, he is somehow slowing down as a runner (he is still an avid one),
but not as a researcher. If anything, his production seems to increase as
the years go by. The number of graduate students that have graduated
under his direction now number in the dozens (I don't know the exact
number). Most of them are now prestigious professionals on their own.
Bob is also an excellent teacher and lecturer. His skill at transmitting
ideas is remarkable. In professional conferences, his talks are usually the
most eagerly followed.
Personally, I first met Bob in the fall of 1982. I was then a second-year
graduate student in Mathematics at Caltech. Bob had just arrived to
Caltech from Illinois. I was looking for an adviser, and I soon found
one! My interaction with him has influenced me for the rest of my life.
We would meet once a week, if at all, and those were quality meetings!
Bob had an uncanny ability to make a remark that would trigger an
idea. It is difficult to explain, he never told me what to do exactly, but
he knew how to inspire a solution to a problem. I also found out that
Bob's curiosity is not limited to technical results. He is well informed
about current events, and I always enjoyed discussing with him any topic
under the sun (I've never shared his enthusiasm for McDonald's food and
Star Wars movies, though). He has had a great influence over my life.
I have with him a debt of gratitude, that I am sure is shared by all of
his ex-students. I present these Proceedings to him as a token of our
appreciation.
These Proceedings were a collective effort. I want to thank my co
editors and great friends, Paddy Farrell and Henk van Tilborg. This is
not the first time we worked together on a project, and having them
at my side is always reassuring. I want to thank the chairmen of the
different sessions of the Workshop: Sol Golomb, Bahram Honary, Mike
Pursley, Oliver Collins, Ilya Dumer and Will Lin. They were the ones
that really sought the great contributions that you find in this volume.
I thank the authors, not only for their great results, but also for having
to put up with my inexperience as an editor. I have burdened them
with repeated and sometimes contradictory requests, and they always
took them with a sense of humor. Last but not least, I want to thank
Kluwer's editors Jennifer Evans and Anne Murray, their patience with
me was outstanding. I promise them that next time I will be much more
efficient!
The Workshop organization involved many people and probably I
will not be able to thank them all. I hope nobody feels postponed.
David MacKay created and maintained the Web site of the Workshop,
http://www.inference.phy.cam.ac.uk/bobj. MeinaXu and Shirley Beatty
were outstanding with the local organization at Caltech. Laif Swanson
was always there to make the right suggestion. And I want to thank my
friend Shuki Bruck for more reasons than I can enumerate.
Finally, I would like to acknowledge the generous financial support
provided by the Lee Center for Advanced Networking and the Electrical
Engineering department at Caltech, this is a nice gift and a wonderful
recognition from Bob's intellectual home.
And this is enough for a preface, so, dear reader, enjoy this book.
Mario Blaum, San Jose, California
x
A Cornputational Theory of Surprise
Pierre Baldi
Department of Information and Computer Science
California Institute for Telecommunications and
Information Technology
University of California, Irvine
Irvine, CA 92697-3425
[email protected]
Abstract
While eminently successful for the transmission of data, Shan
non's theory of information does not address semantic and subjec
tive dimensions of data, such a.'l relevance and surprise. We propose
an observer-dependent computational theory of surprise where sur
prise is defined by the relative entropy between the prior and the
posterior distributions of an observer. Surprise requires integTa
tion over the space of models in contra.'lt with Shannon's entropy,
which requires integration over the space of data. We show how
surprise can be computed exactly in a number of discrete and con
tinuous cases using distributions from the exponential family with
conjugate priors. We show that during sequential Bayesian learn
ing, surprise decreases like liN and study how surprise differs and
complements Shannon's definition of information.
Keywords: Information, Surprise, Relevance, Bayesian Probabilities,
Entropy, Relative Entropy.
M. Blaum et al. (eds.), Information, Coding and Mathematics
© Springer Science+Business Media New York 2002