1 citations · 1 across the 7 of their papers we have counts for
10 papers
XOR-Trellis: Ultra-Low-Complexity Dequantization and Curvature-Aware Hadamard-Free LLM Quantization
Xiaofan Que, Nir Elkayam, Spandan Pyakurel +2
Trellis-coded quantization enables high-dimensional compression of large language model (LLM) weights at ultra-low bit widths without the exponentially large codebooks required by…
Universal Decoding via the Pairwise Error Probability
Nir Elkayam, Meir Feder
We develop a theory of universal decoding built on the pairwise error probability (PEP) primitive of a companion paper. The PEP and its error spectrum are defined for an arbitrary…
One-Shot Information Theory via the Pairwise Error Probability: Lossy, Joint Source-Channel, Erasure, and Multiuser Coding
Nir Elkayam, Meir Feder
This paper extends a one-shot (finite-blocklength) information-theoretic framework built on a single primitive: the pairwise error probability (PEP) of a randomized, dither-broken…
A Pairwise-Error-Probability Framework for One-Shot Information Theory
Nir Elkayam, Meir Feder
We develop a one-shot (finite-blocklength) channel-coding framework based on the pairwise error probability (PEP) of a decoder with randomized tie-breaking. The tie-breaking rule y…
One shot approach to lossy source coding under average distortion constraints
Nir Elkayam, Meir Feder
This paper presents a one shot analysis of the lossy compression problem under average distortion constraints. We calculate the exact expected distortion of a random code. The resu…
Variational formulas for the power of the binary hypothesis testing problem with applications
Nir Elkayam, Meir Feder
Two variational formulas for the power of the binary hypothesis testing problem are derived. The first is given as the Legendre transform of a certain function and the second, indu…
On the calculation of the minimax-converse of the channel coding problem
Nir Elkayam, Meir Feder
A minimax-converse has been suggested for the general channel coding problem by Polyanskiy etal. This converse comes in two flavors. The first flavor is generally used for the anal…
Achievable and Converse bounds over a general channel and general decoding metric
Nir Elkayam, Meir Feder
Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up t…
A Universal Decoder Relative to a Given Family of Metrics
Nir Elkayam, Meir Feder
Consider the following framework of universal decoding suggested in [MerhavUniversal]. Given a family of decoding metrics and random coding distribution (prior), a single, universa…
Information Spectrum Approach to the Source Channel Separation Theorem
Nir Elkayam, Meir Feder
A source-channel separation theorem for a general channel has recently been shown by Aggrawal et. al. This theorem states that if there exist a coding scheme that achieves a maximu…