Search · four archives
Search · four archives
15 papers · ranked by Valyu relevance
Yizhu Wang, Wenyi Zhang
It is well known that for Gaussian channels, a nearest neighbor decoding rule, which seeks the minimum Euclidean distance between a codeword and the received channel output vector, is the maximum likelihood solution and hence capacity-achieving. Nearest neighbor decoding remains a convenient and yet mismatched solution…
Shuqin Pang, Wenyi Zhang
Case Study of Interference Suppression Authors: ['Shuqin Pang' 'Wenyi Zhang'] Abstract—In this work, generalized nearest neighbor decoding (GNND), a recently proposed receiver architecture, is studied for channels under general input constellations, and multiuser uplink interference suppression is employed as a case…
Shuqin Pang, Wenyi Zhang
—Information transmission over a multiple-inputmultiple-output (MIMO) fading channel with imperfect channel state information (CSI) is investigated, under a new receiver architecture which combines the recently proposed generalized nearest neighbor decoding rule (GNNDR) and a successive procedure in the spirit of…
Steven M. Peterson, Zoe Steine-Hanson, Nathan Davis, Rajesh P. N. Rao + 1 more
Advances in neural decoding have enabled brain-computer interfaces to perform increasingly complex and clinically-relevant tasks. However, such decoders are often tailored to specific participants, days, and recording sites, limiting their practical long-term usage. Therefore, a fundamental challenge is to develop…
Tagir Akhmetshin, Arkadii Lin, Timur Madzhidov, Alexandre Varnek
Autoencoders represent a promising technique for the inverse quantitative structure-activity relationship (QSAR) task. However, undesirable bias, such as atom ordering, affects the neighbourhood behaviour of autoencoders’ latent space and, consequently, usage of the latent vectors as variables in machine-learning…
Ferdinand Blomqvist, Oliver W. Gnilke, Marcus Greferath
Generalized concatenated codes were introduced in the 1970s by Zinoviev. There are many types of codes in the literature that are known by other names that can be viewed as generalized concatenated codes. Examples include matrix-product codes, multilevel codes and generalized cascade codes. Decoding algorithms for…
Hedongliang Liu, Sabine Pircher, Alexander Zeh, Antonia Wachter-Zeh
—Generalized Goppa codes are defined by a code locator set L of polynomials and a Goppa polynomial G(x). When the degree of all code locator polynomials in L is one, generalized Goppa codes are classical Goppa codes. In this work, binary generalized Goppa codes are investigated. First, a parity-check matrix for these…
Qiwang Chen, Zhiping Xu, Huihui Wu, Guofa Cai + 2 more
'Sadaf Salehkalaibar'] A key component of the joint source-channel coding (JSCC) scheme based on double low-density parity-check (D-LDPC) codes is the introduction of a linking matrix between the source LDPC code and channel LDPC code, by which the decoding information including the source redundancy and channel state…
Andrew Stokely, Lane Votapka, Marcus Hock, Abigail Teitgen + 3 more
We present the Netsci program - an open-source scientific software package that leverages GPU acceleration and a k-nearest-neighbor algorithm in order to estimate the mutual information (MI) between data in a set. The GPU acceleration presented here, as an improvement upon existing estimators, enables calculation…
Jingcheng Zhang, Lei Chen, Jinlin Sun, Shumin Li + 5 more
DNA has emerged as a compelling archival storage medium, offering unprecedented information density and millennia-scale durability. Despite its promise, DNA-based data storage faces critical challenges due to error-prone processes during DNA synthesis, storage, and sequencing. In this study, we introduce Gungnir, a…
Jovan Milojković, Srdjan Brkić, Predrag Ivaniš, Bane Vasić + 1 more
'Jun Chen'] In this paper, we introduce a novel gradient descent bit-flipping algorithm with a finite state machine (GDBF-wSM) for iterative decoding of low-density parity-check (LDPC) codes. The algorithm utilizes a finite state machine to update variable node potentials-for each variable node, the corresponding…
Nikhil Parthasarathy, Eleanor Batty, William Falcon, Thomas Rutten + 3 more
Decoding sensory stimuli from neural signals can be used to reveal how we sense our physical environment, and is valuable for the design of brain-machine interfaces. However, existing linear techniques for neural decoding may not fully reveal or exploit the fidelity of the neural signal. Here we develop a new…
Simone Blanco Malerba, Aurora Micheli, Michael Woodford, Rava Azeredo da Silveira
The efficient coding approach proposes that neural systems represent as much sensory information as biological constraints allow. It aims at formalizing encoding as a constrained optimal process. A different approach, that aims at formalizing decoding, proposes that neural systems instantiate a generative model of the…
Li Deng, Kai Tao, Zhiping Shi, You Zhang + 5 more
In this paper, some optimized encoding and decoding schemes are proposed for the generalized LDPC convolutional codes (GLDPC-CCs). In terms of the encoding scheme, a flexible doping method is proposed, which replaces multiple single parity check (SPC) nodes with one generalized check (GC) node. Different types of BCH…
Daniel Probst
Last year, a preprint gained notoriety, proposing that a k-nearest neighbour classifier is able to outperform large-language models using compressed text as input and normalised compression distance (NCD) as a metric. In chemistry and biochemistry, molecules are often represented as strings, such as SMILES for small…