{"title":"具有大基数的子空间网络码","authors":"E. Gabidulin, N. Pilipchuk","doi":"10.1109/ENT.2015.18","DOIUrl":null,"url":null,"abstract":"A network is considered as a directed acyclic graph. A source sends to a destination packets organized as a matrix over the finite field. Such a matrix can be treated as a subspace over the finite field spanned by matrix rows. We investigate an important problem how to construct subspace network codes with large cardinality. We obtained conditions where these codes have maximal cardinality.","PeriodicalId":242681,"journal":{"name":"2015 International Conference on Engineering and Telecommunication (EnT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Subspace Network Codes with Large Cardinality\",\"authors\":\"E. Gabidulin, N. Pilipchuk\",\"doi\":\"10.1109/ENT.2015.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A network is considered as a directed acyclic graph. A source sends to a destination packets organized as a matrix over the finite field. Such a matrix can be treated as a subspace over the finite field spanned by matrix rows. We investigate an important problem how to construct subspace network codes with large cardinality. We obtained conditions where these codes have maximal cardinality.\",\"PeriodicalId\":242681,\"journal\":{\"name\":\"2015 International Conference on Engineering and Telecommunication (EnT)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Engineering and Telecommunication (EnT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ENT.2015.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Engineering and Telecommunication (EnT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENT.2015.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A network is considered as a directed acyclic graph. A source sends to a destination packets organized as a matrix over the finite field. Such a matrix can be treated as a subspace over the finite field spanned by matrix rows. We investigate an important problem how to construct subspace network codes with large cardinality. We obtained conditions where these codes have maximal cardinality.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
