Selected topics in information and coding theory
I. Woungang,S Misra,Sudip Misra +2 more
Reads0
Chats0
TLDR
This book discusses Coding Theory and Algebraic Combinatorics, Network Coding for Acyclic and Cyclic Networks, and Distributed Space-Time Codes with Low ML Decoding Complexity Construction of High Coding Gain Lattices with Low Decoding complexity.Abstract:
Linear Complexity and Related Complexity Measures Asymptotic Theory of Algebraic Geometry Codes Some Algebraic and Combinatorial Methods of Code Constructions Variable Length Codes and Finite Automata Applications of Universal Source Coding to Statistical Analysis of Time Series Decoding and Finding the Minimum Distance with Grobner Bases: History and New Insights Coding Theory and Algebraic Combinatorics Cooperative Diversity Systems for Wireless Communication Introduction to Network Coding for Acyclic and Cyclic Networks Distributed Space-Time Codes with Low ML Decoding Complexity Construction of High Coding Gain Lattices with Low Decoding Complexity Distributed Joint Source-Channel Coding on a Multiple Access Channel Algebraic Coding from Matrix and Group Rings: Block Codes LDPC and Convolutional Codes from Matrix and Group Rings Public Key Cryptography and Coding Theory Low-Density Parity-Check Codes.read more
Citations
More filters
Book ChapterDOI
Recent results on recursive nonlinear pseudorandom number generators
TL;DR: In this paper, a survey article collects recent results on recursive nonlinear pseudorandom number generators and sketches some important proof techniques, including upper bounds on additive character sums and lower bounds on the linear complexity profile and closely related lattice tests.
Book ChapterDOI
Code Based Cryptography and Steganography
TL;DR: The aim of this paper is to show how algebraic coding theory offers ways to define secure cryptographic primitives and efficient steganographic schemes.
Journal ArticleDOI
Combinatorial bounds and characterizations of splitting authentication codes
TL;DR: A combinatorial lower bound on the number of encoding rules and a combinatorially characterization of optimal splitting authentication codes that are multi-fold secure against spoofing attacks are proved.
Book ChapterDOI
Pseudorandom vector sequences derived from triangular polynomial systems with constant multipliers
TL;DR: A new class of dynamical systems generated by iterations of a class of multivariate permutation polynomial systems is studied and it is shown that they admit stronger estimates than in the general case and thus can be of use for pseudorandom number generation.
Journal ArticleDOI
On the subfield subcodes of Hermitian codes
Fernando Piñero,Heeralal Janwa +1 more
TL;DR: Some of the subfield subcodes of Hermitian codes are at least as good as the previously known codes, and the existence of good long codes is shown.