M. Bossert, W. Schnug, H. Dieterich, S. Shavgulidze
{"title":"带外经纱的广义编织物码的构造及自由距离估计","authors":"M. Bossert, W. Schnug, H. Dieterich, S. Shavgulidze","doi":"10.1109/ISIT.2000.866383","DOIUrl":null,"url":null,"abstract":"A new class of convolutional codes, namely generalized woven codes with outer warp is presented. The codes are based on nested classes of inner single convolutional code and many outer convolutional codes with different redundancies. We give a lower bound on the free distance for these codes.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The construction and free distance estimation of generalized woven codes with outer warp\",\"authors\":\"M. Bossert, W. Schnug, H. Dieterich, S. Shavgulidze\",\"doi\":\"10.1109/ISIT.2000.866383\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new class of convolutional codes, namely generalized woven codes with outer warp is presented. The codes are based on nested classes of inner single convolutional code and many outer convolutional codes with different redundancies. We give a lower bound on the free distance for these codes.\",\"PeriodicalId\":108752,\"journal\":{\"name\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2000.866383\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2000.866383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The construction and free distance estimation of generalized woven codes with outer warp
A new class of convolutional codes, namely generalized woven codes with outer warp is presented. The codes are based on nested classes of inner single convolutional code and many outer convolutional codes with different redundancies. We give a lower bound on the free distance for these codes.