发布求助
文献互助 智能选刊 最新文献

2006 IEEE Information Theory Workshop - ITW '06 Chengdu最新文献

筛选
英文 中文
An Introduction to Tensor Product Codes and Applications to Digital Storage Systems 张量积代码及其在数字存储系统中的应用简介
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323741
J. Wolf
{"title":"An Introduction to Tensor Product Codes and Applications to Digital Storage Systems","authors":"J. Wolf","doi":"10.1109/ITW2.2006.323741","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323741","url":null,"abstract":"Tensor product (TP) codes result from combining two constituent error control codes in a particular manner. Depending upon the types of constituent codes used, the resulting codes can be error detection codes, error correction codes, error location codes, or some combination thereof. In this paper a review of these codes will be given and possible applications to digital storage systems will be discussed","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128391641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
Construction of Optimal Edit Metric Codes 最优编辑度量码的构造
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323799
S. Houghten, D. Ashlock, J. Lenarz
{"title":"Construction of Optimal Edit Metric Codes","authors":"S. Houghten, D. Ashlock, J. Lenarz","doi":"10.1109/ITW2.2006.323799","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323799","url":null,"abstract":"The edit distance between two strings is the minimal number of substitutions, deletions, or insertions required to transform one string into another. An error correcting code over the edit metric includes features from deletion-correcting codes as well as the more traditional codes defined using Hamming distance. Applications of edit metric codes include the creation of robust tags over the DNA alphabet. This paper explores the theory underlying edit metric codes for small alphabets. The size of a sphere about a word is heavily dependent on its block structure, or its partition into maximal subwords of a single symbol. This creates a substantial divergence from the theory for the Hamming metric. An optimal code is one with the maximum possible number of codewords for its length and minimum distance. We provide tables of bounds on code sizes for edit codes with short length and small alphabets. We describe issues relating to exhaustive searches and present several heuristics for constructing codes","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"45 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131036653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Syndrome-coding for the wiretap channel revisited 重新审视了窃听频道的综合症编码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323748
G. Cohen, G. Zémor
{"title":"Syndrome-coding for the wiretap channel revisited","authors":"G. Cohen, G. Zémor","doi":"10.1109/ITW2.2006.323748","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323748","url":null,"abstract":"To communicate an r-bit secret s through a wire-tap channel, the syndrome coding strategy consists of choosing a linear transformation h and transmitting an n-bit vector x such that h(x) = s. The receiver obtains a corrupted version of x and the eavesdropper an even more corrupted version of x: the (syndrome) function h should be chosen in such a way as to minimize both the length n of the transmitted vector and the information leakage to the eavesdropper. We give a refined analysis of the information leakage that involves m-th moment methods","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134090635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
Optimal Interleaving Schemes for 2-D Arrays 二维阵列的最优交错方案
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323691
S. Golomb, R. Mena, Wen-Qing Xu
{"title":"Optimal Interleaving Schemes for 2-D Arrays","authors":"S. Golomb, R. Mena, Wen-Qing Xu","doi":"10.1109/ITW2.2006.323691","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323691","url":null,"abstract":"Given an m times n array of k single random error correction (or erasure) codewords, each having length l such that mn = kl, we construct optimal interleaving schemes that provide the maximum burst error correction power such that an arbitrarily shaped error burst of size t can be corrected for the largest possible value of t. We show that for all such m times n arrays, the maximum possible interleaving distance, or equivalently, the largest value of t such that an arbitrary error burst of size up to t can be corrected, is bounded by lfloorradic2krfloor if k les lceil(min{m, n})2/2rceil, and by min{m, n} + lfloor(k - lceil(min{m, n})2/2rceil) / min{m, n}rfloor if k ges lceil(min{m, n})2/2rceil. We generalize the cyclic shifting algorithm developed by the authors in a previous paper and construct, in several special cases, optimal interleaving arrays achieving these upper bounds","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133981424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Reduced Complexity Decoding Algorithms for STBC-MTCM in Fast Fading Channels 快速衰落信道中STBC-MTCM的低复杂度译码算法研究
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323841
D.N. Liu, M. Fitz
{"title":"On Reduced Complexity Decoding Algorithms for STBC-MTCM in Fast Fading Channels","authors":"D.N. Liu, M. Fitz","doi":"10.1109/ITW2.2006.323841","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323841","url":null,"abstract":"STBC-MTCM scheme which achieves high rate, full diversity and large coding gains is an outstanding example of transmit diversity scheme for multiple-antenna system. In the case of time selective fast fading (TSFF) or frequency selective fading (FSF) channels, the performance of current existing STBC-MTCM decoder suffers from an irreducible error floor. In this paper, we present two computational efficient decoding algorithms: zero-forcing (ZF) detector and linear minimum mean square error (LMMSE) detector to combat the fast fading channels. The proposed decoding algorithms provide a robust performance across range of channel conditions from quasi-static (slow) fading to TSFF or FSF. Simulation results suggest that our proposed decoding algorithms have near maximum-likelihood (ML) performance while being computational more efficient","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122126191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Random and not-so-random codes for quantum channels 量子信道的随机和非随机代码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323777
A. Winter
{"title":"Random and not-so-random codes for quantum channels","authors":"A. Winter","doi":"10.1109/ITW2.2006.323777","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323777","url":null,"abstract":"Summary form only given. Recently, after being open for almost a decade, a complete proof of the quantum channel coding theorem was given by Devetak, using a peculiar code construction described as `random CSS code'. Unlike in it's classical analogue, Shannon's channel coding, the code depends not only on a test source but also on the channel. Recently, M Horodecki, S Lloyd, P Shor and me found not only one but several random code families which are described only in terms of a test source. It turns out that the error analysis for these codes is extremely simple and conceptually interesting. An overview of these code constructions and their applicability will be given in the talk. However, it has been understood for a while that random codes only achieve the quantum capacity if test sources of arbitrary block length are considered; hence, no single-letter formula for the quantum capacity is known. I will discuss what is known regarding this peculiarity, connected to the nondegeneracy of random quantum codes, and present a single-letter upper bound on the quantum capacity (derived in joint work with G Smith)","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123854742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the queueing delay of a multicast erasure channel 组播擦除信道的排队延迟
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323834
B. Shrader, A. Ephremides
{"title":"On the queueing delay of a multicast erasure channel","authors":"B. Shrader, A. Ephremides","doi":"10.1109/ITW2.2006.323834","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323834","url":null,"abstract":"In this work we address the stability and delay performance of a multicast erasure channel with random arrivals at the source node. We consider both a standard retransmission (ARQ) scheme as well as random linear coding. Our results show that while random linear coding may outperform re-transmissions for heavy traffic, the delay incurred by the use of random linear codes is significantly higher when the source is lightly loaded","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124078139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 37
A Parallel Iterative Acquisition Algorithm for Multiple PN Codes 多PN码的并行迭代获取算法
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323694
Zhisong Bie, K. Niu, Weilin Wu
{"title":"A Parallel Iterative Acquisition Algorithm for Multiple PN Codes","authors":"Zhisong Bie, K. Niu, Weilin Wu","doi":"10.1109/ITW2.2006.323694","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323694","url":null,"abstract":"Based on factor graph and sum-product algorithm, an iterative acquisition algorithm for multiple PN codes is proposed. This algorithm combines the BP decoding algorithm and the chip level MUD as an iterative loop to fulfil the task of parallel acquisition for multiple PN codes. Simulation and analysis results show that the performance of this algorithm is slightly poorer than the full parallel search method, but the computational costs are decreased dramatically","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127123292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Expected Value for the Probability of an Undetected Error 未检测到错误概率的期望值
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323791
P. Perry, M. Fossorier
{"title":"The Expected Value for the Probability of an Undetected Error","authors":"P. Perry, M. Fossorier","doi":"10.1109/ITW2.2006.323791","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323791","url":null,"abstract":"The expected value for the probability of an undetected error for a linear code over the binary symmetric channel, with p being a continuous random variable, is calculated. The random variable p is assumed to be from the interval [0,¿] or the interval [0,1], with uniform distributions and beta distributions being used. Simple conditions on the weight enumerator of the code and its dual code are given to minimize the expected value for the probability of an undetected error. A necessary condition for good error detection is derived.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129812520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
New Upper and Lower Bounds on Exponentially Weighted Average Length of Optimal Binary Prefix Codes 最优二进制前缀码指数加权平均长度的新上下界
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323812
Yen-Yi Lee, Jay Cheng, Tien-Ke Huang
{"title":"New Upper and Lower Bounds on Exponentially Weighted Average Length of Optimal Binary Prefix Codes","authors":"Yen-Yi Lee, Jay Cheng, Tien-Ke Huang","doi":"10.1109/ITW2.2006.323812","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323812","url":null,"abstract":"In this paper, we consider the exponentially weighted average codeword length introduced by Campbell as a performance measure for source codes. This criterion assumes that the cost is an exponential function of the codeword length and includes the usual expected codeword length criterion as a special case. Such situations could arise when the cost for encoding and decoding is significant, or if the buffer overflow caused by long codewords is a serious issue. Under Campbell's average codeword length criterion, we derive new upper and lower bounds on the exponentiated expected length of optimal binary prefix codes when partial information about the source symbol probabilities is available","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123125065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信