English
Related papers

Related papers: Linear Correction of Mismatched L-values in BICM r…

200 papers

The problem of clock offset estimation in a two way timing message exchange regime is considered when the likelihood function of the observation time stamps is Gaussian, exponential or log-normally distributed. A parametrized solution to…

Information Theory · Computer Science 2012-02-01 Aitzaz Ahmad , Davide Zennaro , Erchin Serpedin , Lorenzo Vangelista

Searches for gravitational waves with km-scale laser interferometers often involve the long-wavelength approximation to describe the detector response. The prevailing assumption is that the corrections to the detector response due to its…

General Relativity and Quantum Cosmology · Physics 2008-11-26 M. Rakhmanov , J. D. Romano , J. T. Whelan

In this paper, we address the problem of robust adaptive beamforming of signals received by a linear array. The challenge associated with the beamforming problem is twofold. Firstly, the process requires the inversion of the usually…

Information Theory · Computer Science 2016-11-22 Mohamed Suliman , Tarig Ballal , Tareq Y. Al-Naffouri

Variational regularization is commonly used to solve linear inverse problems, and involves augmenting a data fidelity by a regularizer. The regularizer is used to promote a priori information and is weighted by a regularization parameter.…

Optimization and Control · Mathematics 2024-01-23 Matthias J. Ehrhardt , Silvia Gazzola , Sebastian J. Scott

Modulo-wrapping receivers have attracted interest in several areas of digital communications, including precoding and lattice coding. The asymptotic capacity and error performance of the modulo AWGN channel have been well established.…

Information Theory · Computer Science 2021-05-21 Gizem Tabak , Andrew Singer

Undetected errors are important for linear codes, which are the only type of errors after hard decision and automatic-repeat-request (ARQ), but do not receive much attention on their correction. In concatenated channel coding, suboptimal…

Information Theory · Computer Science 2019-01-09 Jingzhao Wang , Yuan Luo

Under polynomial time reduction, the maximum likelihood decoding of a linear code is equivalent to computing the error distance of a received word. It is known that the decoding complexity of standard Reed-Solomon codes at certain radius is…

Number Theory · Mathematics 2015-08-13 Li Yujuan , Zhu Guizhen

We propose a new finite sample corrected variance estimator for the linear generalized method of moments (GMM) including the one-step, two-step, and iterated estimators. Our formula additionally corrects for the over-identification bias in…

Econometrics · Economics 2026-02-03 Jungbin Hwang , Byunghoon Kang , Seojeong Lee

Tensor-based modulation (TBM) has been proposed in the context of unsourced random access for massive uplink communication. In this modulation, transmitters encode data as rank-1 tensors, with factors from a discrete vector constellation.…

Information Theory · Computer Science 2021-11-04 Alexis Decurninge , Ingmar Land , Maxime Guillaud

Interleaving is a mechanism universally used in wireless access technologies to alleviate the effect of channel correlation. In spite of its wide adoption, to the best of our knowledge, there are no analytical models proposed so far. In…

Information Theory · Computer Science 2018-01-31 Dmitri Moltchanov , Pavel Kustarev , Yevgeni Kucharyavy

As AI-based code generation becomes widespread, researchers are investigating the calibration of code LLMs - ensuring their confidence scores faithfully represent the true likelihood of code correctness. To do so, we investigate…

Software Engineering · Computer Science 2025-12-10 Viola Campos , Robin Kuschnereit , Adrian Ulges

Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…

Information Theory · Computer Science 2007-07-13 Igal Sason , Shlomo Shamai

We examine the capacity of beamforming over a single-user, multi-antenna link taking into account the overhead due to channel estimation and limited feedback of channel state information. Multi-input single-output (MISO) and multi-input…

Information Theory · Computer Science 2010-11-22 Wiroonsak Santipach , Michael L. Honig

The construction of optimal linear block error-correcting codes is not an easy problem, for this, many studies describe methods for generating good error correcting codes in terms of minimum distance. In a previous work, we have presented…

Information Theory · Computer Science 2015-09-11 M. Askali , S. Nouh , A. Azouaoui , M. Belkasmi

Error exponents characterize the exponential decay, when increasing message length, of the probability of error of many error-correcting codes. To tackle the long standing problem of computing them exactly, we introduce a general,…

Disordered Systems and Neural Networks · Physics 2007-07-16 Thierry Mora , Olivier Rivoire

We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio…

Information Theory · Computer Science 2011-09-01 Olav Geil , Casper Thomsen

Speculative decoding accelerates autoregressive large language model (LLM) inference by using a lightweight draft model to propose candidate tokens that are then verified in parallel by the target model. The speedup is significantly…

Machine Learning · Computer Science 2026-03-02 Alexander Samarin , Sergei Krutikov , Anton Shevtsov , Sergei Skvortsov , Filipp Fisin , Alexander Golubev

We consider the problem of linear transceiver design to achieve max-min fairness in a downlink MIMO multicell network. This problem can be formulated as maximizing the minimum rate among all the users in an interfering broadcast channel…

Information Theory · Computer Science 2012-09-03 Meisam Razaviyayn , Mingyi Hong , Zhi-Quan Luo

Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax approach,…

Information Theory · Computer Science 2007-08-01 Yaniv Akirav , Neri Merhav

We present precision corrections to dispersion relation bounds on form factors in bottom hadron semileptonic decays and analyze their effects on parameterizations derived from these bounds. We incorporate QCD two-loop and nonperturbative…

High Energy Physics - Phenomenology · Physics 2009-10-30 C. Glenn Boyd , Benjamin Grinstein , Richard F. Lebed
‹ Prev 1 8 9 10 Next ›