1 citations · 1 across the 7 of their papers we have counts for
Showing 2014 · cs.ITShow all
2 papers · 2 filters
cs.IT2014
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…
cs.IT2014
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…