线性码的子集子码

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2012-10-25 DOI:10.1109/RED.2012.6338415

A. Urivskiy

{"title":"线性码的子集子码","authors":"A. Urivskiy","doi":"10.1109/RED.2012.6338415","DOIUrl":null,"url":null,"abstract":"We consider a problem of finding codes over alphabets whose size s is not equal to the size of any finite field. We adopted an approach when a linear block code is taken over some finite field GF(q) such that q >; s. Then a subcode is being found such that all the code symbols of all its codewords belong to a subset of GF(q) of size s. Upper and lower bounds on the cardinality of the subset subcode are given. Also coding procedures are considered. Error detection and/or correction procedures are those of the parent code.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On subset subcodes of linear codes\",\"authors\":\"A. Urivskiy\",\"doi\":\"10.1109/RED.2012.6338415\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a problem of finding codes over alphabets whose size s is not equal to the size of any finite field. We adopted an approach when a linear block code is taken over some finite field GF(q) such that q >; s. Then a subcode is being found such that all the code symbols of all its codewords belong to a subset of GF(q) of size s. Upper and lower bounds on the cardinality of the subset subcode are given. Also coding procedures are considered. Error detection and/or correction procedures are those of the parent code.\",\"PeriodicalId\":403644,\"journal\":{\"name\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RED.2012.6338415\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2012.6338415","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们考虑一个在字母上寻找码的问题，其大小s不等于任何有限域的大小。我们采用了一种方法，当一个线性分组码被置于某个有限域GF(q)上时，使得q >;s.然后找到一个子码，使其所有码字的所有码符都属于大小为s的GF(q)的子集。给出该子码子集的基数的上界和下界。还考虑了编码过程。错误检测和/或纠正程序是父代码的程序。

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

查看原文本刊更多论文

On subset subcodes of linear codes

We consider a problem of finding codes over alphabets whose size s is not equal to the size of any finite field. We adopted an approach when a linear block code is taken over some finite field GF(q) such that q >; s. Then a subcode is being found such that all the code symbols of all its codewords belong to a subset of GF(q) of size s. Upper and lower bounds on the cardinality of the subset subcode are given. Also coding procedures are considered. Error detection and/or correction procedures are those of the parent code.

求助全文

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

来源期刊

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems

自引率

0.00%

发文量