Results 21 to 30 of about 211 (203)

Reserved-length prefix coding [PDF]

2008 IEEE International Symposium on Information Theory, 2008
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of lengths (or, equivalently, no codewords have lengths that lie in a complementary set).
openaire   +2 more sources

Intelligent Path-Selection-Aided Decoding of Polar Codes

Entropy, 2023
CRC-aided successive cancellation list (CA-SCL) decoding is a powerful algorithm that dramatically improves the error performance of polar codes. Path selection is a major issue that affects the decoding latency of SCL decoders. Generally, path selection
Hongji Cui, Kai Niu, Shunfu Zhong
doaj   +1 more source

Efficient Channel Coding for Dimmable Visible Light Communications System

IEEE Access, 2020
Visible light communication (VLC) offers wireless communication within short-range based on wavelength converters and light-emitting diode (LED). In the VLC system, conventional forward error correction (FEC) codes are not guaranteed to provide flicker ...
Oluwaseyi Paul Babalola, Vipin Balyan
doaj   +1 more source

How to Construct Polar Codes for Ring-LWE-Based Public Key Encryption

Entropy, 2021
There exists a natural trade-off in public key encryption (PKE) schemes based on ring learning with errors (RLWE), namely: we would like a wider error distribution to increase the security, but it comes at the cost of an increased decryption failure rate
Jiabo Wang, Cong Ling
doaj   +1 more source

Compressed Matching in Dictionaries

Algorithms, 2011
The problem of compressed pattern matching, which has recently been treated in many papers dealing with free text, is extended to structured files, specifically to dictionaries, which appear in any full-text retrieval system.
Shmuel T. Klein, Dana Shapira
doaj   +1 more source

A New Fast Vertical Method for Mining Frequent Patterns [PDF]

International Journal of Computational Intelligence Systems, 2010
Vertical mining methods are very effective for mining frequent patterns and usually outperform horizontal mining methods. However, the vertical methods become ineffective since the intersection time starts to be costly when the cardinality of tidset (tid-
Zhihong Deng, Zhonghui Wang
doaj   +1 more source

A New Approach to Improve Transmitting and Receiving Timing in Orthogonal Frequency Division Multiplexing (OFDM) Systems

Iraqi Journal for Computer Science and Mathematics, 2023
Nowadays, most wireless communications employ OFDM technology to reduce signal interference. Its sensitivity to timing faults, however, can cause a severe performance reduction.
Ghassan A. Abed
doaj   +1 more source

Dendrograms of electroencephalograms and their characterization based on metrics [PDF]

Известия Саратовского университета. Новая серия: Математика. Механика. Информатика
Dendrograms obtained from electroencephalograms are studied as maximal prefix codes. A dendrogram defines a distribution on the space of 2-adic integers and represents a partition, up to the set of zero Haar measure, into balls of nonzero radii.
Tyapaev, Livat Borisovich, Anashin, Vladimir S.   +1 more
doaj   +1 more source

Editorial: Special Issue on Data Compression Algorithms and Their Applications

Algorithms, 2020
This Special Issue of Algorithms is focused on data compression algorithms and their applications.
Philip Bille
doaj   +1 more source

Entropic Bounds on the Average Length of Codes with a Space

Entropy
We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average ...
Roberto Bruno, Ugo Vaccaro
doaj   +1 more source