Enumerative source encoding
From MaRDI portal
Cited in
(25)- Information compression and Varshamov-Gilbert bound
- Efficient m-ary balanced codes
- Message encoding and retrieval for spread and cyclic orbit codes
- Preimage selective trapdoor function: how to repair an easy problem
- Line Hermitian Grassmann codes and their parameters
- Implementing line-Hermitian Grassmann codes
- Fast enumeration of words generated by Dyck grammars
- Enumerative coding for line polar Grassmannians with applications to codes
- An efficient post-quantum one-time signature scheme
- A novel block-based scheme for arithmetic coding
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Weak oblivious transfer from strong one-way functions
- New Definition of Density on Knapsack Cryptosystems
- McEliece Cryptosystem Implementation: Theory and Practice
- Enumerative encoding of correlation-immune Boolean functions
- The whole and the parts: the minimum description length principle and the a-contrario framework
- Frame permutation quantization
- Theory and design ofm-ary balanced codes which are invariant under symbol permutation
- Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
- An efficient algorithm for group testing with runlength constraints
- Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
- Fast decoding of interleaved linearized Reed-Solomon codes and variants
- Constructing perfect steganographic systems
- Enumeration of constant-weight run-length limited binary sequences
- Text compression methods
This page was built for publication: Enumerative source encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661780)
