{"title":"线性擦除块码在有理数Q或代数结构的领域Ψq","authors":"Yehor Savchenko","doi":"10.1109/ICCT.2018.8600217","DOIUrl":null,"url":null,"abstract":"In this paper, we define a mathematical model of linear erasure block codes (k, C) for symbol erasure channels (SEC) that are built over either a field of rational numbers $Q$ or an algebraic structure $\\pmb{\\Psi q}$. We show the necessary condition for the codes (k, C) to be optimal, and we demonstrate that some of the already existing erasure codes may be considered as the specific cases of the codes (k, C) over a $\\pmb{\\Psi_{q}}$, such as Luby Transform, Raptor or Zigzag Decodable.","PeriodicalId":244952,"journal":{"name":"2018 IEEE 18th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Linear Erasure Block Codes over Either a Field of Rational Numbers Q or an Algebraic Structure Ψq\",\"authors\":\"Yehor Savchenko\",\"doi\":\"10.1109/ICCT.2018.8600217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we define a mathematical model of linear erasure block codes (k, C) for symbol erasure channels (SEC) that are built over either a field of rational numbers $Q$ or an algebraic structure $\\\\pmb{\\\\Psi q}$. We show the necessary condition for the codes (k, C) to be optimal, and we demonstrate that some of the already existing erasure codes may be considered as the specific cases of the codes (k, C) over a $\\\\pmb{\\\\Psi_{q}}$, such as Luby Transform, Raptor or Zigzag Decodable.\",\"PeriodicalId\":244952,\"journal\":{\"name\":\"2018 IEEE 18th International Conference on Communication Technology (ICCT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 18th International Conference on Communication Technology (ICCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2018.8600217\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 18th International Conference on Communication Technology (ICCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2018.8600217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Linear Erasure Block Codes over Either a Field of Rational Numbers Q or an Algebraic Structure Ψq
In this paper, we define a mathematical model of linear erasure block codes (k, C) for symbol erasure channels (SEC) that are built over either a field of rational numbers $Q$ or an algebraic structure $\pmb{\Psi q}$. We show the necessary condition for the codes (k, C) to be optimal, and we demonstrate that some of the already existing erasure codes may be considered as the specific cases of the codes (k, C) over a $\pmb{\Psi_{q}}$, such as Luby Transform, Raptor or Zigzag Decodable.