Lattice code design criterion for MIMO wiretap channels

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Information Theory Workshop

• Publication date

  2015-12-21

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/ITWF.2015.7360779
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Achieving AWGN Channel Capacity With Lattice Gaussian Coding

  2013cited by this paper
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

  2012cited by this paper
• Short proofs for the determinant identities

  2011cited by this paper
• Expectations of Functions of Complex Wishart Matrix

  2011cited by this paper
• An Error Probability Approach to MIMO Wiretap Channels

  2011cited by this paper
• Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel

  2010cited by this paper
• An MMSE Approach to the Secrecy Capacity of the MIMO Gaussian Wiretap Channel

  2009cited by this paper
• A Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel

  2007cited by this paper
• The secrecy capacity of the MIMO wiretap channel

  2007cited by this paper
• On the capacity of spatially correlated MIMO Rayleigh-fading channels

  2003cited by this paper
• Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction

  1998cited by this paper
• The wire-tap channel

  1975cited by this paper
• Table of Integrals, Series, and Products

  1966cited by this paper

• A Design Criterion for the Rayleigh Fading Wiretap Channel Based on \({\ell^1}\)-Norm Theta Functions

  2024cites this paper
• Lattice-Reduction-Aided Gibbs Algorithm for Lattice Gaussian Sampling: Convergence Enhancement and Decoding Optimization

  2019cites this paper
• Analysis of Some Well-Rounded Lattices in Wiretap Channels

  2018cites this paper
• Markov Chain Monte Carlo Methods for Lattice Gaussian Sampling: Convergence Analysis and Enhancement

  2018cites this paper
• Markov chain Monte Carlo Methods For Lattice Gaussian Sampling: Lattice Reduction and Decoding Optimization

  2018cites this paper
• Semantically Secure Lattice Codes for Compound MIMO Channels

  2018cites this paper
• Lattice Codes for Physical Layer Communications

  2017cites this paper
• Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling

  2017cites this paper
• Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels

  2016influential citation
• Well-rounded lattices for reliability and security in Rayleigh fading SISO channels

  2016cites this paper
• Well-rounded lattices for coset coding in MIMO wiretap channels

  2016cites this paper
• On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes

  2016influential citation
• Information bounds and flatness factor approximation for fading wiretap MIMO channels

  2016cites this paper
• Almost Universal Codes for MIMO Wiretap Channels

  2016cites this paper
• On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling

  2015cites this paper