{"title":"基于一维和二维格的n维球面填料的协集码构造","authors":"F. Kschischang, S. Pasupathy","doi":"10.1109/PACRIM.1989.48370","DOIUrl":null,"url":null,"abstract":"A technique for constructing N-dimensional sphere packings from certain one- and two-dimensional lattices is described. The packings are constructed as coset codes and take advantage of partitions of the base lattices that result in Hamming spaces. Known Hamming metric codes over GF(2), GF(3), GF(5), and GF(7) are used in the construction. The resulting packings are compared with the best known packings in each dimension. At low dimensions, many of these packings are the densest known; as the dimension increases, however, the packings become inferior to the best known ones.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Coset code constructions of N-dimensional sphere packings from 1- and 2-dimensional lattices\",\"authors\":\"F. Kschischang, S. Pasupathy\",\"doi\":\"10.1109/PACRIM.1989.48370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A technique for constructing N-dimensional sphere packings from certain one- and two-dimensional lattices is described. The packings are constructed as coset codes and take advantage of partitions of the base lattices that result in Hamming spaces. Known Hamming metric codes over GF(2), GF(3), GF(5), and GF(7) are used in the construction. The resulting packings are compared with the best known packings in each dimension. At low dimensions, many of these packings are the densest known; as the dimension increases, however, the packings become inferior to the best known ones.<<ETX>>\",\"PeriodicalId\":256287,\"journal\":{\"name\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1989.48370\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1989.48370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coset code constructions of N-dimensional sphere packings from 1- and 2-dimensional lattices
A technique for constructing N-dimensional sphere packings from certain one- and two-dimensional lattices is described. The packings are constructed as coset codes and take advantage of partitions of the base lattices that result in Hamming spaces. Known Hamming metric codes over GF(2), GF(3), GF(5), and GF(7) are used in the construction. The resulting packings are compared with the best known packings in each dimension. At low dimensions, many of these packings are the densest known; as the dimension increases, however, the packings become inferior to the best known ones.<>