Document - eBookmela
Loading...

Cryptography and coding : 8th IMA international conference, Cirencester, UK, December 17 19, 2001 : proceeding | Honary, Bahram

Likes0
Telegram icon Share on Telegram

Cryptography and coding : 8th IMA international conference, Cirencester, UK, December 17 19, 2001 : proceeding

User Rating: Be the first one!

Author: Honary, Bahram

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2001

Language: eng

Subjects: Coding theory, Cryptography

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540430261

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 196.10 MB

PDF Size: 5.63 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 854

Views: 904

Total Files: 18

Media Type: texts

Description

Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17–19, 2001 Proceedings
Author: Bahram Honary
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-43026-1
DOI: 10.1007/3-540-45325-3

Table of Contents:

  • A Statistical Decoding Algorithm for General Linear Block Codes
  • On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory
  • The Complete Weight Enumerator for Codes over M
  • Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem
  • A Simple Soft-Input/Soft-Output Decoder for Hamming Codes
  • A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks
  • Key Recovery Attacks on MACs Based on Properties of Cryptographic APIs
  • The Exact Security of ECIES in the Generic Group Model
  • A New Ultrafast Stream Cipher Design: COS Ciphers
  • On Rabin-Type Signatures
  • Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)
  • Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps
  • Almost-Certainly Runlength-Limiting Codes
  • Weight vs. Magnetization Enumerator for Gallager Codes
  • Graph Configurations and Decoding Performance
  • A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing
  • The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems
  • Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
  • Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding
  • The Wide Trail Design Strategy

Includes bibliographical references
eBookmela
Logo
Register New Account