Results 11 to 20 of about 9,216 (163)
Arithmetic Coding for Data Compression [PDF]
Proceedings of the IEEE, 1994 Arithmetic coding provides an effective mechanism for removing redundancy in the encoding of data. We show how arithmetic coding works and describe an efficient implementation that uses table lookup as a first alternative to arithmetic operations. The reduced-precision arithmetic has a provably negligible effect on the amount of compression achieved ...
Howard, Paul G., Vitter, Jeffrey Scott
openaire +4 more sources
Error Recovery Properties and Soft Decoding of Quasi-Arithmetic Codes
EURASIP Journal on Advances in Signal Processing, 2007 This paper first introduces a new set of aggregated state models for soft-input decoding of quasi arithmetic (QA) codes with a termination constraint. The decoding complexity with these models is linear with the sequence length. The aggregation parameter
Christine Guillemot +2 more
doaj +1 more source
Design of Packet-Based Block Codes with Shift Operators
EURASIP Journal on Wireless Communications and Networking, 2010 This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information
Jacek Ilow, Ali Al-Shaikhi
doaj +2 more sources
FPGA-Oriented LDPC Decoder for Cyber-Physical Systems
Mathematics, 2020 A potentially useful Cyber-Physical Systems element is a modern forward error correction (FEC) coding system, utilizing a code selected from the broad class of Low-Density Parity-Check (LDPC) codes. In this paper, development of a hardware implementation
Mateusz Kuc +2 more
doaj +1 more source
Fast and Efficient Entropy Coding Architectures for Massive Data Compression
Technologies, 2023 The compression of data is fundamental to alleviating the costs of transmitting and storing massive datasets employed in myriad fields of our society. Most compression systems employ an entropy coder in their coding pipeline to remove the redundancy of ...
Francesc Auli-Llinas
doaj +1 more source
Weierstrass points on modular curves X0(N) fixed by the Atkin–Lehner involutions [PDF]
Arab Journal of Mathematical Sciences, 2023 Purpose – The authors have determined whether the points fixed by all the full and the partial Atkin–Lehner involutions WQ on X0(N) for N ≤ 50 are Weierstrass points or not.
Mustafa Bojakli, Hasan Sankari
doaj +1 more source
A new DNA-based model for finite field arithmetic
Heliyon, 2019 A Galois field GF(pn) with p≥2 a prime number and n≥1 is a mathematical structure widely used in Cryptography and Error Correcting Codes Theory. In this paper, we propose a novel DNA-based model for arithmetic over GF(pn).
Iván Jirón +4 more
doaj +1 more source
A Side-Channel Attack on a Masked IND-CCA Secure Saber KEM Implementation
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, we present a side-channel attack on a first-order masked implementation of IND-CCA secure Saber KEM. We show how to recover both the session key and the long-term secret key from 24 traces using a deep neural network created at the ...
Kalle Ngo +3 more
doaj +1 more source
Frontiers in Psychology, 2022 Research suggests that children’s exposure to pollutants may impact their neurocognitive development. While researchers have found associations between air pollutants and cognitive development, these associations remain underspecified.
Josh Medrano +3 more
doaj +1 more source
Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes
EURASIP Journal on Advances in Signal Processing, 2004 The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source.
Guionnet Thomas, Guillemot Christine
doaj +1 more source