Arithmetic coding of messages using random sequence

zbMATH Open1448.94004MaRDI QIDQ5117079FDOQ5117079

Authors: Vladimir N. Potapov 

Publication date: 20 August 2020

Full work available at URL: http://mathnet.ru/eng/pdm47

Recommendations

• Integrated encryption in dynamic arithmetic compression
• Publication:4936731
• Secure binary arithmetic coding based on digitalized modified logistic map and linear feedback shift register
• A secure arithmetic coding based on Markov model
• scientific article; zbMATH DE number 67079

Mathematics Subject Classification ID

Communication theory (94A05)

Cited In (5)

• Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
• Rising of efficiency of enciphering on the basis of summation of products
• Integrated encryption in dynamic arithmetic compression
• A method for fast timer coding of texts
• A fast method for complete randomization of messages.

This page was built for publication: Arithmetic coding of messages using random sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117079)