Lattice Erasure Codes of Low Rank with Noise Margins

Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no erasures subject to rate and power constraints while ensuring that the error probability under an allowable erasure pattern is bounded from above....

Full description

Saved in:
Bibliographic Details
Published in2018 IEEE International Symposium on Information Theory (ISIT) pp. 961 - 965
Main Author Vaishampayan, Vinay A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2018
Subjects
Online AccessGet full text
ISSN2157-8117
DOI10.1109/ISIT.2018.8437515

Cover

Abstract Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no erasures subject to rate and power constraints while ensuring that the error probability under an allowable erasure pattern is bounded from above. Allowable erasure patterns considered here are those of fixed cardinality. Bounds on performance are derived, and several constructions are investigated for lattices in dimension four. It is shown that the problem can be viewed as a simultaneous ellipsoid packing problem, a generalization of the well known sphere packing problem.
AbstractList Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no erasures subject to rate and power constraints while ensuring that the error probability under an allowable erasure pattern is bounded from above. Allowable erasure patterns considered here are those of fixed cardinality. Bounds on performance are derived, and several constructions are investigated for lattices in dimension four. It is shown that the problem can be viewed as a simultaneous ellipsoid packing problem, a generalization of the well known sphere packing problem.
Author Vaishampayan, Vinay A.
Author_xml – sequence: 1
  givenname: Vinay A.
  surname: Vaishampayan
  fullname: Vaishampayan, Vinay A.
  organization: Dept. of Engineering Science and Physics, City University of New York-College of Staten Island, Staten Island, NY, USA
BookMark eNotj8tKw0AUQEdRsNZ8gLiZH0icO-8sJdQaiApa1-VOcqPjI5FMpPj3FixncXYHzjk7GcaBGLsEUQCI8rp-rjeFFOALr5UzYI5YVjoPRnmr91bHbCHBuNwDuDOWpfQuhJDWa1vCgukG5zm2xFcTpp-JeDV2lPjY82bc8SccPvguzm_8YYyJ-D1Or3FIF-y0x89E2cFL9nK72lR3efO4rqubJo_gzJxb12lFQqINBMp47ILSoesCQCudN06WGHTfSYfYgqY9jlxf2hYtKhfUkl39dyMRbb-n-IXT7_bwqf4A9TVHRA
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ISIT.2018.8437515
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781538647813
1538647818
EISSN 2157-8117
EndPage 965
ExternalDocumentID 8437515
Genre orig-research
GroupedDBID 6IE
6IH
6IK
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i175t-67d43e02a6be1358adb34bddb11c2785729ab4fd27aac14e4e47e7f96ca6a37b3
IEDL.DBID RIE
IngestDate Wed Aug 27 02:59:35 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-67d43e02a6be1358adb34bddb11c2785729ab4fd27aac14e4e47e7f96ca6a37b3
PageCount 5
ParticipantIDs ieee_primary_8437515
PublicationCentury 2000
PublicationDate 2018-June
PublicationDateYYYYMMDD 2018-06-01
PublicationDate_xml – month: 06
  year: 2018
  text: 2018-June
PublicationDecade 2010
PublicationTitle 2018 IEEE International Symposium on Information Theory (ISIT)
PublicationTitleAbbrev ISIT
PublicationYear 2018
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002684691
ssj0037302
Score 1.6721562
Snippet Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no...
SourceID ieee
SourceType Publisher
StartPage 961
SubjectTerms Ellipsoid Packing
Ellipsoids
Erasure Codes
Error probability
Generators
Information theory
Lattices
Modulation
Rotation Matrices
Sphere Packing
Upper bound
Title Lattice Erasure Codes of Low Rank with Noise Margins
URI https://ieeexplore.ieee.org/document/8437515
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Na8IwGA7O005u07FvcthxrWmTNulZFB0qY1PwJvl4CyK0w1YG-_VL2urY2GHkEgIJ-X7Cm-d5X4QewyClPAF7vmPGPUa18IRU4BlmsdvicyorefRsHo-X7HkVrVro6aiFAYCKfAa-y1Z_-SbXe2cq6wtGeeQU5SdcxLVW62hPcV5LKr8v9S1M7c4Nm1_MgCT9ydtk4Yhcwm8a-RFNpQKTUQfNDt2oOSRbf18qX3_-8tD4336eod63bA-_HAHpHLUgu0CdQ9wG3BzjLmJTWTrOGx7uKgMhHuQGCpyneJp_4FeZbbEzz-J5vikAu1C4m6zooeVouBiMvSZ6grexT4LSi7lhFEgoYwUBjYQ0ijJljAoCHXIR2Ve1VCw1IZdSBwxs4sDTJNYylpQreonaWZ7BFcKBMcRQAUBMxGz1xN7WhNKQGKWVCsk16rpJWL_XDjLWzfhv_i6-RaduIWq-1R1ql7s93FtkL9VDtaRfVZmhSw
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3Pa8IwFH6IO2wnt-nY7-Ww41rbJm3asyi6VRmbgjdJmlcQoRWtDPbXL2mrY2OHkUsIJOT3F16-7z2AR89NKY9Qn--AcYvRJLRCIdFSTGO3xudUlPLo8SQYztjz3J834OmghUHEknyGtsmWf_kqT3bGVNYNGeW-UZQf-Ywxv1JrHSwqxm9J6fmluoep3rte_Y_pOlF39D6aGipXaNfN_IinUsLJoAXjfUcqFsnK3hXSTj5_-Wj8b09PofMt3COvB0g6gwZm59DaR24g9UFuA4tFYVhvpL8pTYSklyvckjwlcf5B3kS2IsZASyb5covEBMNdZtsOzAb9aW9o1fETrKV-FBRWwBWj6HgikOhSPxRKUiaVkq6beDz09btaSJYqjwuRuAx14sjTKEhEICiX9AKaWZ7hJRBXKUfRENFRPtPVI31fO5R6jpKJlJ5zBW0zCYt15SJjUY__-u_iBzgeTsfxIh5NXm7gxCxKxb66hWax2eGdxvlC3pfL-wX6i6SY
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2018+IEEE+International+Symposium+on+Information+Theory+%28ISIT%29&rft.atitle=Lattice+Erasure+Codes+of+Low+Rank+with+Noise+Margins&rft.au=Vaishampayan%2C+Vinay+A.&rft.date=2018-06-01&rft.pub=IEEE&rft.eissn=2157-8117&rft.spage=961&rft.epage=965&rft_id=info:doi/10.1109%2FISIT.2018.8437515&rft.externalDocID=8437515