12 papers · ranked by Valyu relevance
H. Yamamoto, Ken-ichi Iwata
This paper proposes a new lossless data compression coding scheme named an asymmetric encoding-decoding scheme (AEDS), which can be considered as a generalization of tANS (tabled variant of asymmetric numeral systems). In the AEDS, a data sequence s = s1s 2 · · · s n is encoded in backward order st, t = n, · · · , 2…
Yuhang Wang, Weihua Chen, Linjing Song, Zhiping Xu + 6 more
With the rapid growth of data volume in sensor networks, lossy source coding systems achieve high-efficiency data compression with low distortion under limited transmission bandwidth. However, conventional compression algorithms rely on a two-stage framework with high computational complexity and frequently struggle to…
Yubo Sun, Gennian Ge
Motivated by applications in in-vivo DNA storage, we study codes for correcting duplications. A reverse-complement duplication of length k is the insertion of the reversed and complemented copy of a substring of length k adjacent to its original position, while a palindromic duplication only inserts the reversed copy…
Ibrahim Al-dayel, Muhammad Faisal Nadeem, Yasir Bashir, Ayesha Shabbir + 1 more
We propose an information-theoretic encryption scheme consisting of a four-dimensional chaotic map driver in combination with a prediction model using an LSTM neural net to generate a keystream, which was limited only after passing a test based on the largest Lyapunov exponent (LLE). Our security analysis used a…
Kaan Doğan Erdoğan, Nurettin Doğan, Heena Rathore, Yuchen Jiang + 1 more
One of the major challenges in securing medical image communication systems is the secure and efficient management of cryptographic key material. In this paper, we propose a multi-layer image encryption algorithm that addresses image security while reducing per-image key-storage and transmission overhead under a…
S. Subathra, V. Thanikaiselvan
A new multistage encryption algorithm is proposed by integrating the deep neural network with a new 4D multi-scroll chaotic map to enhance the efficiency and improve the security of image transmission in the open channel. This combined network expands the key space and maintains the secrecy of the key with the…
Julia Lieb, Michael Schaller
The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column distances maximize the column distances for a given arbitrary finite field. In this paper, we present a construction of such convolutional…
Tilo Strutz, Roman Rischke
—The transmission or storage of signals typically involves data compression. The final processing step in compression systems is generally an entropy coding stage, which converts symbols into a bit stream based on their probability distribution. A distinct class of entropy coding methods operates not by mapping input…
Rashmi Naveen, Archana Praveen Kumar, Sahana Roshan
Security is the main attribute when dealing with information exchange. Confidential information theft, data loss, and data manipulation are conceivable results of security events. Different forms of data hiding are Cryptography and Steganography. Cryptography converts information into an unreadable form, and…
Yuchen Liao, Wenyi Zhang
—In downlink massive random access (DMRA), a base station transmits messages to a typically small subset of active users, selected randomly from a massive number of total users. Explicitly encoding the identities of active users would incur a significant overhead scaling logarithmically with the number of total users.…
Ying Chen, Jianrong Bao, Yanhai Shang, Chao Liu + 5 more
To obtain efficient channel codes with high power efficiency at moderate signal-to-noise ratios (SNRs), an efficient high-rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is optimally constructed. By an optimized protograph template, the code framework is firstly produced by the extensions of the…
Ezequiel López-Rubio
The reflected binary Gray code arranges the fixed-length binary representations of the integers so that consecutive numbers differ in a single bit. Its usefulness, however, is tied to a fixed word length $b$, which both caps the range of representable numbers at $2^{b}-1$ and wastes bits on small integers. We introduce…