2-查询局部可解码线性码的最优下界

{"title":"2-查询局部可解码线性码的最优下界","authors":"K. Obata","doi":"10.1007/3-540-45726-7_4","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"49","resultStr":"{\"title\":\"Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes\",\"authors\":\"K. Obata\",\"doi\":\"10.1007/3-540-45726-7_4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":423704,\"journal\":{\"name\":\"International Workshop Randomization and Approximation Techniques in Computer Science\",\"volume\":\"115 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"49\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop Randomization and Approximation Techniques in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-45726-7_4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop Randomization and Approximation Techniques in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-45726-7_4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}