阿贝尔码的信息集

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI:10.1109/CIG.2010.5592836

J. J. Bernal, J. Simón

{"title":"阿贝尔码的信息集","authors":"J. J. Bernal, J. Simón","doi":"10.1109/CIG.2010.5592836","DOIUrl":null,"url":null,"abstract":"All throughout F denotes the field with q elements where q is a power of a prime p. Given C, a linear code of dimension k, and length n over the field F, an information set for C is a set of positions {i1, …, ik} such that restricting the codewords to these positions we get the hole space Fk. The codeword symbols in these positions are called information symbols and the other n — k positions are called check positions ([10]).","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Information sets for abelian codes\",\"authors\":\"J. J. Bernal, J. Simón\",\"doi\":\"10.1109/CIG.2010.5592836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"All throughout F denotes the field with q elements where q is a power of a prime p. Given C, a linear code of dimension k, and length n over the field F, an information set for C is a set of positions {i1, …, ik} such that restricting the codewords to these positions we get the hole space Fk. The codeword symbols in these positions are called information symbols and the other n — k positions are called check positions ([10]).\",\"PeriodicalId\":354925,\"journal\":{\"name\":\"2010 IEEE Information Theory Workshop\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2010.5592836\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592836","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

整个F表示有q个元素的域，其中q是素数p的幂。给定C，维度为k的线性码，长度为n，在域F上，C的信息集是位置{i1，…，ik}的集合，使得将码字限制在这些位置上，我们得到空穴空间Fk。这些位置上的码字符号称为信息符号，其他n - k个位置称为检查位置([10])。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Information sets for abelian codes

All throughout F denotes the field with q elements where q is a power of a prime p. Given C, a linear code of dimension k, and length n over the field F, an information set for C is a set of positions {i1, …, ik} such that restricting the codewords to these positions we get the hole space Fk. The codeword symbols in these positions are called information symbols and the other n — k positions are called check positions ([10]).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE Information Theory Workshop

自引率

0.00%

发文量