{"title":"代码同步，环切开术和有限几何","authors":"V. Tonchev","doi":"10.1109/ITW.2006.1633827","DOIUrl":null,"url":null,"abstract":"The paper surveys some recent combinatorial constructions of optimal comma-free codes being cosets of linear codes that explore cyclotomy and partitions of hyperplanes or complements of hyperplanes in a finite projective geometry.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Code Synchronization, Cyclotomy, and Finite Geometry\",\"authors\":\"V. Tonchev\",\"doi\":\"10.1109/ITW.2006.1633827\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper surveys some recent combinatorial constructions of optimal comma-free codes being cosets of linear codes that explore cyclotomy and partitions of hyperplanes or complements of hyperplanes in a finite projective geometry.\",\"PeriodicalId\":293144,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2006.1633827\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633827","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Code Synchronization, Cyclotomy, and Finite Geometry
The paper surveys some recent combinatorial constructions of optimal comma-free codes being cosets of linear codes that explore cyclotomy and partitions of hyperplanes or complements of hyperplanes in a finite projective geometry.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
