• Publications
  • Influence
Achieving the secrecy capacity of wiretap channels using Polar codes
TLDR
We use polar codes to construct a coding scheme that achieves the secrecy capacity of general wiretap channels as long as both C 1 and C 2 are symmetric and binary-input. Expand
  • 228
  • 26
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
TLDR
We use polar codes to construct a coding scheme that achieves the secrecy capacity for a wide range of wiretap channels. Expand
  • 241
  • 20
  • PDF
A nearly optimal construction of flash codes
TLDR
In this paper, we present a new construction of flash codes that approaches this lower bound to within a factor logarithmic in k. Expand
  • 58
  • 11
  • PDF
Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes
TLDR
A scheme for concatenating binary polar codes with interleaved Reed-Solomon codes captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. Expand
  • 63
  • 6
  • PDF
Relaxed Polar Codes
TLDR
Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of binary-input discrete memoryless channels. Expand
  • 23
  • 5
  • PDF
Algebraic list-decoding on the operator channel
TLDR
The operator channel was introduced by Koetter and Kschischang as a model of errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). Expand
  • 35
  • 4
Polar Coding for Bit-Interleaved Coded Modulation
TLDR
A polar coding scheme is proposed for reliable communication over channels with bit-interleaved coded modulation (BICM). Expand
  • 44
  • 3
Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding
TLDR
We consider the problem of polar coding for transmission over m-user multiple access channels. Expand
  • 26
  • 3
  • PDF
List-decoding of subspace codes and rank-metric codes up to Singleton bound
  • Hessam Mahdavifar
  • Computer Science, Mathematics
  • IEEE International Symposium on Information…
  • 4 February 2012
TLDR
Subspace codes and rank-metric codes can be used to correct errors and erasures in network, with linear network coding. Expand
  • 32
  • 2
  • PDF
Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding
TLDR
We utilize BCH codes and their analogous in the Lee space to construct explicit and systematic codes that are immune to up to r sticky insertions. Expand
  • 17
  • 2