scientific article; zbMATH DE number 3586931
From MaRDI portal
Publication:4156696
zbMATH Open0376.94011MaRDI QIDQ4156696FDOQ4156696
Authors: Robert J. McEliece 
Publication date: 1977
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Theory of error-correcting codes and error-detecting codes (94B99)
Cited In (65)
- New bounds for perfect hashing via information theory
- Good codes based on very sparse matrices
- Boolean autoencoders and hypercube clustering complexity
- Generalized rank functions and an entropy argument
- Some results on ordering of survival functions through uncertainty
- On regular 3-wise intersecting families
- \(H\)-colouring bipartite graphs
- Majorization, Csiszár divergence and Zipf-Mandelbrot law
- A combinatorial problem for vector spaces over finite fields
- Attainable results in committee elections.
- Comparison of the normalized Jensen functionals of two convex functions with applications
- Boltzmann-Shannon entropy and the double-slit experiment
- A hybrid EM approach to spatial clustering
- Repeated games with stationary bounded recall strategies
- \(H\)-coloring tori
- GAS, a concept on modeling species in genetic algorithms
- Range of cube-indexed random walk
- The number of 4-colorings of the Hamming cube
- Uncertainty in physiology and physics
- Complex-valued autoencoders
- Some intersection theorems for ordered sets and graphs
- On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\)
- State space realizations and monomial equivalence for convolutional codes
- Coding Markov chains from the past
- On viewing block codes as finite automata.
- Some upper bounds for relative entropy and applications
- An inequality for logarithmic mapping and applications for the Shannon entropy
- Entropy of sums of random digits
- Some bounds on entropy measures in information theory
- A cryptosystem for multiple communication
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- Best Huffman trees
- Union-free hypergraphs and probability theory
- Of bits and wows: a Bayesian theory of surprise with applications to attention
- How to avoid the cheaters succeeding in the key sharing scheme
- A counterpart of Jensen's discrete inequality for differentiable convex mappings and applications in information theory
- Dynamics of defects in the vector complex Ginzburg-Landau equation
- On information gain, Kullback-Leibler divergence, entropy production and the involution kernel
- On the commutativity of discrete memoryless channels in cascade
- Simple algorithms for decoding systematic Reed-Solomon codes
- Computer algebra tales on Goppa codes and McEliece cryptography
- Higher-order terms in asymptotic expansion for information loss in quantized random processes
- Fredman–Komlós bounds and information theory
- Trees with exponentially growing costs
- An information-theoretic approach to the design of a distributed cascade of sensors
- On output independence and complementariness in rank-based multiple classifier decision systems
- Codes and designs
- Semantic security for the McEliece cryptosystem without random oracles
- Counting maximal antichains and independent sets
- Quantum mechanics over sets: a pedagogical model with non-commutative finite probability theory as its quantum probability calculus
- Planes of order 10 do not have a collineation of order 5
- Intersections of k-element sets
- Asymptotics of the upper matching conjecture
- Computing Logarithms in Finite Fields of Characteristic Two
- Two new decoding algorithms for Reed-Solomon codes
- Title not available (Why is that?)
- Oblivious Transfer Based on the McEliece Assumptions
- A Go-Up code construction from linear codes yielding additive codes for quantum stabilizer codes
- Authentication codes: an area where coding and cryptology meet
- Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m )
- Shannon type inequalities via time scales theory
- Simple proof of security of the multiparty prepare and measure QKD
- Stability for maximal independent sets
- Some decoding applications of minimal realization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156696)
