How to find small AI-systems for antiblocking decoding
From MaRDI portal
(Redirected from Publication:658118)
Recommendations
- Antiblocking decoding
- Optimal block-type-decodable encoders for constrained systems
- scientific article; zbMATH DE number 4112524
- An efficient decoding algorithm for block turbo codes
- Construction of encoders with small decoding look-ahead for input-constrained channels
- Blockcipher-based authenticated encryption: how small can we go?
- Blockcipher-based authenticated encryption: how small can we go?
- Building blockcipher from small-block tweakable blockcipher
- Decoding of block codes obtained from convolution codes
- Smaller decoding exponents: ball-collision decoding
Cites work
- Antiblocking decoding
- Antiblocking systems and PD-sets
- Construction of caps by means of caps in complementary subspaces
- scientific article; zbMATH DE number 3695222 (Why is no real title available?)
- scientific article; zbMATH DE number 1243360 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- PD-sets for the codes related to some classical varieties
- Permutation Decoding of Systematic Codes
Cited in
(1)
This page was built for publication: How to find small AI-systems for antiblocking decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658118)