边信息索引编码

边信息索引编码

ID:38945589

大小:173.09 KB

页数:10页

时间:2019-06-21

边信息索引编码_第1页
边信息索引编码_第2页
边信息索引编码_第3页
边信息索引编码_第4页
边信息索引编码_第5页
资源描述:

《边信息索引编码》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、IndexCodingwithSideInformationZivBar-Yossef∗YitzhakBirk†T.S.Jayram‡TomerKol§Abstractsideinformationaboutx,beforeitissent.SourcecodingwithsideinformationaddressesencodingschemesthatMotivatedbyaproblemoftransmittingdataoverexploitthesideinformationinordertoreducethelengthbroadcastch

2、annels(BirkandKol,INFOCOM1998),weofthecode.Classicalresultsinthisarea[16,19,18]studythefollowingcodingproblem:asendercommuni-describehowtoachieveoptimalrateswithrespecttothecateswithnreceiversR1,...,Rn.Heholdsaninputjointentropyofthesourceandthesideinformation.x∈{0,1}nandwishestob

3、roadcastasinglemessageWitsenhausen[17]initiatedthestudyofthezero-sothateachreceiverRicanrecoverthebitxi.Eacherrorsideinformationproblem.ForeverysourceinputRihaspriorsideinformationaboutx,inducedbyadi-x∈X,thereceivergetsaninputy∈YthatgivessomerectedgraphGonnnodes;Riknowsthebitsofxi

4、ntheinformationaboutx.Thisiscapturedbyrestrictingthepositions{j

5、(i,j)isanedgeofG}.Wecallencodingpairs(x,y)tobelongtoafixedsetL⊆X×Y.BoththeschemesthatachievethisgoalINDEXcodesfor{0,1}nsenderandthereceiverknowL,andthuseachofthem,withsideinformationgraphG.givenhisowninput,hasinformati

6、onabouttheothersInthispaperweidentifyameasureongraphs,theinput.Witsenhausenshowedthatfixed-lengthsidein-minrank,whichweconjecturetoexactlycharacterizeformationcodeswereequivalenttocoloringsofarelatedtheminimumlengthofINDEXcodes.Weresolvetheobjectcalledtheconfusiongraph,andthusthelo

7、garithmconjectureforcertainnaturalclassesofgraphs.Forar-ofthechromaticnumberofthisgraphtightlycharac-bitrarygraphs,weshowthattheminrankboundistightterizestheminimumnumberofbitsneededtoencodeforbothlinearcodesandcertainclassesofnon-linearthesource.FurtherresultsbyAlonandOrlitsky[2]

8、andcodes.Forthegeneralproblem,weobtaina(weaker)Koulgietal.[12]showedthatgraph-theoreticinforma-lowerboundthatthelengthofanINDEXcodeforanytionmeasurescouldbeusedtocharacterizeboththeav-graphGisatleastthesizeofthemaximumacyclicin-eragelengthofvariable-lengthcodes,aswellasasymp-duced

9、subgraphofG.toticratesofcodesthat

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。