Enumerative source encoding
From MaRDI portal
Publication:5661780
DOI10.1109/TIT.1973.1054929zbMath0247.94009OpenAlexW2034323860MaRDI QIDQ5661780
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1973.1054929
Related Items (22)
Enumerative coding for line polar Grassmannians with applications to codes ⋮ The Whole and the Parts: The Minimum Description Length Principle and the A-Contrario Framework ⋮ A novel block-based scheme for arithmetic coding ⋮ Information compression and Varshamov-Gilbert bound ⋮ Enumerative encoding of correlation-immune Boolean functions ⋮ New Definition of Density on Knapsack Cryptosystems ⋮ Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Reduced memory meet-in-the-middle attack against the NTRU private key ⋮ Preimage selective trapdoor function: how to repair an easy problem ⋮ McEliece Cryptosystem Implementation: Theory and Practice ⋮ Line Hermitian Grassmann codes and their parameters ⋮ Frame permutation quantization ⋮ Implementing line-Hermitian Grassmann codes ⋮ Constructing perfect steganographic systems ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ Theory and design ofm-ary balanced codes which are invariant under symbol permutation ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ Enumeration of constant-weight run-length limited binary sequences ⋮ Efficient \(m\)-ary balanced codes ⋮ Fast enumeration of words generated by Dyck grammars ⋮ Text compression methods
This page was built for publication: Enumerative source encoding
