Exponential lower bounds for depth 3 Boolean circuits
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Faster solution of the key equation for decoding BCH error-correcting codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Effective erasure codes for reliable computer communication protocols
ACM SIGCOMM Computer Communication Review
Simulating Boolean circuits on a DNA computer
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Decoding algebraic-geometric codes beyond the error-correction bound
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
More efficient PAC-learning of DNF with membership queries under the uniform distribution
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
An implementation of the Vernian Cipher for file security
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
A Gap in GRM Code Weight Distributions
Designs, Codes and Cryptography
On the Distance Distributions of BCH Codes and Their Duals
Designs, Codes and Cryptography
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
Designs, Codes and Cryptography
Tight security proofs for the bounded-storage model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Uniformly Packed Codes and More Distance Regular Graphs from Crooked Functions
Journal of Algebraic Combinatorics: An International Journal
Yet another approach to the extended ternary Golay code
Discrete Mathematics
All q^m-ary CyclicCodes with Cyclic q-ary Image AreKnown
Designs, Codes and Cryptography
An introduction to low-density parity-check codes
Theoretical aspects of computer science
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
List Decoding from Erasures: Bounds and Code Constructions
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Traitor Tracing Algorithms Using List Decoding
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Introduction to Low-Density Parity-Check Codes
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Codes, graphs, and schemes from nonlinear functions
European Journal of Combinatorics
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Hide and Seek: An Introduction to Steganography
IEEE Security and Privacy
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
European Journal of Combinatorics
Simulation of error-prone biological systems
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Decoding turbo-like codes via linear programming
Journal of Computer and System Sciences - Special issue on FOCS 2002
Colorings of the d-regular infinite tree
Journal of Combinatorial Theory Series B
Deterministic polynomial-time quantum algorithms for Simon's problem
Computational Complexity
Limits to list decoding Reed-Solomon codes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Monotone maps, sphericity and bounded second eigenvalue
Journal of Combinatorial Theory Series B
Utilities and distortions: an objective approach to possibilistic coding
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
A note on the decoding complexity of error-correcting codes
Information Processing Letters
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
On the integrality of nth roots of generating functions
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Kleptographic attacks on a cascade of mix servers
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
MacWilliams-type identities for fragment and sphere enumerators
European Journal of Combinatorics
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms (TALG)
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
Secure Computation from Random Error Correcting Codes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
Commutative association schemes
European Journal of Combinatorics
On the maximality of linear codes
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Succinct Representation of Codes with Applications to Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficiency versus convergence of Boolean kernels for on-line learning algorithms
Journal of Artificial Intelligence Research
Quantum algorithms for Simon's problem over nonabelian groups
ACM Transactions on Algorithms (TALG)
Provably good codes for hash function design
IEEE Transactions on Information Theory
New results on periodic sequences with large k-error linear complexity
IEEE Transactions on Information Theory
Sets of frequency hopping sequences: bounds and optimal constructions
IEEE Transactions on Information Theory
On minimal tree realizations of linear codes
IEEE Transactions on Information Theory
Capacity achieving codes from randomness conductors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Invertible extractors and wiretap protocols
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Provably good codes for hash function design
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
On the covering radius of certain cyclic codes
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Error correcting codes over algebraic surfaces
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
A geometric view of decoding AG codes
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Redistribution of mechanical secret shares
FC'02 Proceedings of the 6th international conference on Financial cryptography
Novel algebraic structure for cyclic codes
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On the bit communication complexity of randomized rumor spreading
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Towards efficient designs for in-network computing with noisy wireless channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
Journal of Combinatorial Theory Series A
On subliminal channels in encrypt-on-cast voting systems
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Lower bounds for sparse recovery
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Implementing fault-tolerant services using state machines: beyond replication
DISC'10 Proceedings of the 24th international conference on Distributed computing
SIAM Journal on Discrete Mathematics
How to design trellis codes with large distance properties
ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
Quantum interpolation of polynomilas
Quantum Information & Computation
Non-stabilizer quantum codes from abelian subggroups of the error group
Quantum Information & Computation
A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure
Journal of Mathematical Modelling and Algorithms
The linear span of the frequency hopping sequences in optimal sets
Designs, Codes and Cryptography
CoCo: coding-based covert timing channels for network flows
IH'11 Proceedings of the 13th international conference on Information hiding
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the construction of some optimal polynomial codes
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
The solutions of the third power sum equation for niho type decimations
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Efficient steganography with provable security guarantees
IH'05 Proceedings of the 7th international conference on Information Hiding
Asymptotic analysis on the normalized k-error linear complexity of binary sequences
Designs, Codes and Cryptography
Flexible word design and graph labeling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Correlations between the ranks of submatrices and weights of random codes
Finite Fields and Their Applications
Finite Fields and Their Applications
An improvement of the Feng--Rao bound on minimum distance
Finite Fields and Their Applications
Editorial: A decade of Finite Fields and Their Applications
Finite Fields and Their Applications
Bounds on (n,r)-arcs and their application to linear codes
Finite Fields and Their Applications
On the Sum of Square Roots of Polynomials and Related Problems
ACM Transactions on Computation Theory (TOCT)
Spearman Permutation Distances and Shannon's Distinguishability
Fundamenta Informaticae
Streaming computations with a loquacious prover
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Practical dynamic proofs of retrievability
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
Cryptography and Communications
Building timing predictable embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Linear codes using skew polynomials with automorphisms and derivations
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Hi-index | 0.24 |
From the Publisher:This book has long been considered one of the classic references to an important area in the fields of information theory and coding theory. This third edition has been revised and expanded, including new chapters on algebraic geometry, new classes of codes, and the essentials of the most recent developments on binary codes. Also included are exercises with complete solutions.