الصفحة 1
الصفحة 1
Error-Correction Coding and Decoding : Bounds, Codes, Decoders, Analysis and Applications
This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies, from smartphones to secure communications and transactions. Written in a readily understandable style,This book is a valuable resource for anyone interested in error-correcting codes and their applications, ranging from non-experts to professionals at the forefront of research in their field.
Decoding the city urbanism in the Age of Big Data
Shows how Big Data change reality and, hence, the way we deal with the city. They demonstrate how the Lab interprets digital data as material that can be used for the formulation of a different urban future. The publication also looks at the negative aspects of the city-related data acquisition and control.
Cryptography and coding ; 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings
This book presented signatures, boolean functions, block cipher cryptanalysis, side channels, linear complexity, public key encryption, curves, and RSA implementation.
Cryptography and coding ; 10th IMA International Conference, Cirencester, UK, December 19-21, 2005, Proceedings
Constitutes the refereed proceedings of the 10th IMA International Conference on Cryptography and Coding, held in Cirencester, UK, in December 2005. This book features papers that are organized in topical sections on coding theory, signatures and signcryption, symmetric cryptography, side channels, algebraic cryptanalysis, and more.
Coding and Cryptography ; International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005, Revised Selected Papers
This volume contains refereed papers devotedtocodingandcrypto graphy.These papers arethe full versionsof a selectionof the best extended abstractsaccepted for presentation at the International Workshop on Coding and Cryptography (WCC 2005) held in Bergen, Norway, March 14–18, 2005. Each of the 118 - tended abstracts originallysubmitted to the workshop were reviewed by at least two members of the Program Committee. As a result of this screening process, 58 papers were selected for presentation, of which 52 were eventually presented at the workshop together with four invited talks.
Codes et turbocodes = Codes and turbo codes
Devoted to one of the essential functions of modern telecommunications systems: channel coding, or error-correcting coding. At the crossroads of information theory, mathematics, and electronics, channel coding has undergone numerous developments since the foundational work of Claude Shannon. Algebraic codes, convolutional codes, and concatenated codes decoded iteratively form the core of the book, which also includes a presentation of digital modulations, to which channel coding is closely linked, forming the heart of the physical layer of telecommunications systems. The most important theoretical aspects are presented, and the construction of the codes is detailed and justified. Decoding algorithms are developed and, where possible, accompanied by simulation results that demonstrate their error-correcting capabilities and applications.
List decoding of error-correcting codes : Winning thesis of the 2002 ACM doctoral dissertation competition
Presents some spectacular new results in the area of decoding algorithms for error-correcting codes. Specifically, it shows how the notion of “list-decoding” can be applied to recover from far more errors, for a wide variety of err- correcting codes, than achievable before. A brief bit of background : error-correcting codes are combinatorial str- tures that show how to represent (or “encode”) information so that it is - silient to a moderate number of errors. Speci?cally, an error-correcting code takes a short binary string, called the message, and shows how to transform it into a longer binary string, called the codeword, so that if a small number of bits of the codewordare ?ipped, the resulting string does not look like any other codeword. The maximum number of errorsthat the code is guaranteed to detect, denoted d, is a central parameter in its design. A basic property of such a code is that if the number of errors that occur is known to be smaller than d/2, the message is determined uniquely. This poses a computational problem, called the decoding problem : compute the message from a corrupted codeword, when the number of errors is less than d/2.
Applied algebra, algebraic algorithms and error-correcting codes ; 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings
Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings, fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra: algebraic algorithms and transforms; sequences and boolean functions.
Applied algebra, algebraic algorithms and error-correcting codes ; 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings
This book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16, held in Las Vegas, NV, USA in February 2006. The 25 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 32 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
