13 papers · ranked by Valyu relevance
Predrag Ivaniš, Srdjan Brkić, Bane Vasić, Syed A. Jafar
We propose a novel variant of the gradient descent bit-flipping (GDBF) algorithm for decoding low-density parity-check (LDPC) codes over the binary symmetric channel. The new bit-flipping rule is based on the reliability information passed from neighboring nodes in the corresponding Tanner graph. The name…
Daniel B. Hier, Tayo Obafemi-Ajayi
Introduction Large language models can be fine-tuned to improve retrieval of biomedical facts that are not reliably accessible after pretraining. We used ontology term-identifier mappings from the Human Phenotype Ontology (HPO) and Gene Ontology (GO) as structured biomedical facts to study fact acquisition during…
Ryun-Han Koo, Jonghyun Ko, Wonjun Shin, Sangwoo Ryu + 9 more
Recent progress in generative modeling has intensified the need for compact, energy-efficient hardware platforms. Yet, implementing image generation directly in hardware remains challenging due to the conflicting requirements of stochastic latent space sampling and deterministic decoding. Here, we show a unified…
Sreejith Sreekumar, Deniz Gündüz, Songze Li
A two-terminal distributed binary hypothesis testing problem over a noisy channel is studied. The two terminals, called the observer and the decision maker, each has access to n independent and identically distributed samples, denoted by $U$ and $V$, respectively. The observer communicates to the decision maker over a…
Siyu Ren, Yanru Yan, Yalin Li, Chao Li + 4 more
Entanglement-assisted quantum communication has substantial advantages in surpassing the power of classical communication by utilizing the entangled state. Up to now, most of entanglement-assisted quantum communications with dense coding are limited to the proof-of-principle experiments. Here, we experimentally…
Neri Merhav, Alex Dytso, Luca Barletta
We consider the problem of encoding a deterministic source sequence (i.e., individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite-state machines. Our first main result is a necessary condition for both reliable and secure transmission in terms of…
Svitlana Matsenko, Oleksiy Borysenko, Sandis Spolitis, Aleksejs Udalcovs + 6 more
'Aleksejs Udalcovs' 'Lilita Gegere' 'Aleksandr Krotov' 'Oskars Ozolins' 'Vjaceslavs Bobrovs' 'Song-Nam Hong' 'T. Aaron Gulliver'] Forward error correction (FEC) codes combined with high-order modulator formats, i.e., coded modulation (CM), are essential in optical communication networks to achieve highly efficient and…
Michael Windisch, Jakob Wassermann, Monica Leba, Olimpiu Stoicuta + 1 more
In communication technologies such as digital watermarking, wireless sensor networks (WSNs), and visual light communication (VLC), error-correcting codes are crucial. The Enhanced Hadamard Error-Correcting Code (EHC), which is based on 2D Hadamard Basis Images, is a novel error correction technique that is presented in…
Niklas Gassner, Julia Lieb, Abhinaba Mazumder, Michael Schaller
In this paper, we present a framework for generic decoding of convolutional codes, which allows us to do cryptanalysis of code-based systems that use convolutional codes as public keys. We then apply this framework to information set decoding, study success probabilities and give tools to choose variables. Finally, we…
Laurie Berrie, Kellyn F Arnold, Georgia D Tomova, Mark S Gilthorpe + 1 more
'Peter W G Tennant'] Title: Abstract Deterministic variables are variables that are functionally determined by one or more parent variables. They commonly arise when a variable has been functionally created from one or more parent variables, as with derived variables, and in compositional data, where the “whole”…
Licheng Mao, Shenghao Yang, Xuan Huang, Yanyan Dong + 1 more
Systematic codes are of important practical interest for communications. Network coding, however, seems to conflict with systematic codes: although the source node can transmit message packets, network coding at the intermediate network nodes may significantly reduce the number of message packets received by the…
Jesús E. Garca, Verónica A. González-López, Gustavo H. Tasca, Karina Y. Yaginuma + 1 more
In the framework of coding theory, under the assumption of a Markov process $(X_{t})$ on a finite alphabet $A,$ the compressed representation of the data will be composed of a description of the model used to code the data and the encoded data. Given the model, the Huffman’s algorithm is optimal for the number of bits…
Tobias Monsees, Oliver Griebel, Matthias Herrmann, Dirk Wübben + 3 more
'Armin Dekorsy' 'Norbert Wehn' 'Syed A. Jafar'] In Message Passing (MP) decoding of Low-Density Parity Check (LDPC) codes, extrinsic information is exchanged between Check Nodes (CNs) and Variable Nodes (VNs). In a practical implementation, this information exchange is limited by quantization using only a small number…