Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523717
A. Kshevetskiy, E. Gabidulin
The only known construction of error-correcting codes in rank metric was proposed in 1985. These were codes with fast decoding algorithm. We present a new construction of rank codes, which defines new codes and includes known codes. This is a generalization of E.M. Gabidulin, 1985. Though the new codes seem to be very similar to subcodes of known rank codes, we argue that these are different codes. A fast decoding algorithm is described
{"title":"The new construction of rank codes","authors":"A. Kshevetskiy, E. Gabidulin","doi":"10.1109/ISIT.2005.1523717","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523717","url":null,"abstract":"The only known construction of error-correcting codes in rank metric was proposed in 1985. These were codes with fast decoding algorithm. We present a new construction of rank codes, which defines new codes and includes known codes. This is a generalization of E.M. Gabidulin, 1985. Though the new codes seem to be very similar to subcodes of known rank codes, we argue that these are different codes. A fast decoding algorithm is described","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126656462","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523741
S. G. Srinivasan, M. Varanasi
Code design for the low SNR MIMO noncoherent correlated Rayleigh fading channel is considered. Design rules which exploit the correlations in the transmit antennas in the MIMO case, to provide gains over the corresponding SIMO case are presented. The Chernoff bound on the average pairwise error probability (APEP) is used to study the effect of the receive correlation matrix on system performance at different SNR regimes. Based on a lower bound on the APEP, which is related to the Bhattacharya coefficient, a technique is proposed to design codes for use with transmit beamforming, with codewords having unequal prior probabilities. The motivation for such codes with unequal priors arises from recent information theoretic results on the low SNR channel. Such constellations are shown to perform substantially better than constellations designed assuming equal priors, at low SNRs
{"title":"Code design for the low SNR noncoherent MIMO block Rayleigh fading channel","authors":"S. G. Srinivasan, M. Varanasi","doi":"10.1109/ISIT.2005.1523741","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523741","url":null,"abstract":"Code design for the low SNR MIMO noncoherent correlated Rayleigh fading channel is considered. Design rules which exploit the correlations in the transmit antennas in the MIMO case, to provide gains over the corresponding SIMO case are presented. The Chernoff bound on the average pairwise error probability (APEP) is used to study the effect of the receive correlation matrix on system performance at different SNR regimes. Based on a lower bound on the APEP, which is related to the Bhattacharya coefficient, a technique is proposed to design codes for use with transmit beamforming, with codewords having unequal prior probabilities. The motivation for such codes with unequal priors arises from recent information theoretic results on the low SNR channel. Such constellations are shown to perform substantially better than constellations designed assuming equal priors, at low SNRs","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121155829","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523394
Y. Sankarasubramaniam, S. McLaughlin
Binary sequences where successive ones are separated by at most k consecutive zeros, are said to be k-constrained. We introduce a new fixed-rate algorithm for efficiently encoding and decoding k-constrained sequences. Our approach is based on bit stuffing proposed by Bender and Wolf. Bit stuffing is a simple algorithm that can produce near-optimal codes for a wide range of constraints. While bit stuffing achieves rates very close to the noiseless capacity, encoding is variable-rate, which severely limits its practical use. In this paper, we present a fixed-rate version of the bit stuff algorithm. High encoding efficiency is achieved by iterative pre-processing of the fixed-length input data to conform it to bit insertion. The encoder then inserts bits to produce a fixed-length output word. Rate computations for the proposed encoding algorithm are discussed, and upper and lower bounds are derived for the asymptotic (in input block length) encoding rate. It is seen that encoding rates very close to the average bit stuff rate are possible with long, fixed-length, input and output blocks. Upper and lower bounds on the asymptotic encoding rate are listed for values of k = 1 to 15
{"title":"A fixed-rate bit stuffing approach for high efficiency k-constrained codes","authors":"Y. Sankarasubramaniam, S. McLaughlin","doi":"10.1109/ISIT.2005.1523394","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523394","url":null,"abstract":"Binary sequences where successive ones are separated by at most k consecutive zeros, are said to be k-constrained. We introduce a new fixed-rate algorithm for efficiently encoding and decoding k-constrained sequences. Our approach is based on bit stuffing proposed by Bender and Wolf. Bit stuffing is a simple algorithm that can produce near-optimal codes for a wide range of constraints. While bit stuffing achieves rates very close to the noiseless capacity, encoding is variable-rate, which severely limits its practical use. In this paper, we present a fixed-rate version of the bit stuff algorithm. High encoding efficiency is achieved by iterative pre-processing of the fixed-length input data to conform it to bit insertion. The encoder then inserts bits to produce a fixed-length output word. Rate computations for the proposed encoding algorithm are discussed, and upper and lower bounds are derived for the asymptotic (in input block length) encoding rate. It is seen that encoding rates very close to the average bit stuff rate are possible with long, fixed-length, input and output blocks. Upper and lower bounds on the asymptotic encoding rate are listed for values of k = 1 to 15","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115958854","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523558
A. Gamal, J. Mammen, B. Prabhakar, D. Shah
In previous work (2004), we characterized the optimal throughput-delay trade-off in static wireless networks as D(n) = Theta(nT(n)), where D(n) and T(n) are the average packet delay and throughput in a network of n nodes, respectively. While this trade-off captured the essential network dynamics, packets needed to scale down with the network size. In this "fluid model", no buffers were required. Due to this packet scaling, D(n) did not correspond to the average delay per bit. That led to the question whether the trade-off remains the same when the packet size is kept constant, which necessitates buffers and packet scheduling in the network. In this paper, we answer this question in the affirmative by showing that the optimal throughput-delay trade-off is still D(n) = Theta(nT(n)), where now D(n) is the average delay per bit. Packets of constant size necessitate the use of buffers in the network, which in turn requires scheduling packet transmissions in a discrete-time queueing network and analyzing the corresponding delay. Our method consists of deriving packet schedules in the discrete-time network by looking at a corresponding continuous-time network and then analyzing the delay induced in the actual discrete network using results from queueing theory for continuous-time networks
{"title":"Throughput-delay scaling in wireless networks with constant-size packets","authors":"A. Gamal, J. Mammen, B. Prabhakar, D. Shah","doi":"10.1109/ISIT.2005.1523558","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523558","url":null,"abstract":"In previous work (2004), we characterized the optimal throughput-delay trade-off in static wireless networks as D(n) = Theta(nT(n)), where D(n) and T(n) are the average packet delay and throughput in a network of n nodes, respectively. While this trade-off captured the essential network dynamics, packets needed to scale down with the network size. In this \"fluid model\", no buffers were required. Due to this packet scaling, D(n) did not correspond to the average delay per bit. That led to the question whether the trade-off remains the same when the packet size is kept constant, which necessitates buffers and packet scheduling in the network. In this paper, we answer this question in the affirmative by showing that the optimal throughput-delay trade-off is still D(n) = Theta(nT(n)), where now D(n) is the average delay per bit. Packets of constant size necessitate the use of buffers in the network, which in turn requires scheduling packet transmissions in a discrete-time queueing network and analyzing the corresponding delay. Our method consists of deriving packet schedules in the discrete-time network by looking at a corresponding continuous-time network and then analyzing the delay induced in the actual discrete network using results from queueing theory for continuous-time networks","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131466544","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523667
Mikko Vehkaperä, M. Médard
In this paper we propose an information theoretic framework for studying coding and throughput optimization for multi-layered packet transmission systems. Our approach assumes that the system is divided into two separate layers: One code word forms a packet at the physical layer and the code at the network layer spans over these packets. At the receiver, the network layer assumes that the decoded packets arriving from the physical layer either have no errors or are marked as deleted. Thus, albeit the packet loss may be caused, for example, by decoding error, congestion or channel conditions, the network layer treats all decoding errors as erasures regardless of the cause. This allows us to view the system at the network layer as transmission over memoryless erasure channel. We study the throughput optimization and code design across the layers under a total code length constraint while taking also into account the network layer imperfections in the transmission. We use random coding error exponents to achieve results that do not depend on specific coding scheme used. The proposed scheme provides also means for investigating important physical layer phenomena, such as, channel model and lower layer error correction coding in the packet erasure models. Our approach extends to fading channels and networks of multiple nodes and by viewing the two layers of coding as a concatenated coding scheme, a comparison between layer-by-layer and joint cross-layer rate optimization can be made, as outlined in this paper
{"title":"A throughput-delay trade-off in packetized systems with erasures","authors":"Mikko Vehkaperä, M. Médard","doi":"10.1109/ISIT.2005.1523667","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523667","url":null,"abstract":"In this paper we propose an information theoretic framework for studying coding and throughput optimization for multi-layered packet transmission systems. Our approach assumes that the system is divided into two separate layers: One code word forms a packet at the physical layer and the code at the network layer spans over these packets. At the receiver, the network layer assumes that the decoded packets arriving from the physical layer either have no errors or are marked as deleted. Thus, albeit the packet loss may be caused, for example, by decoding error, congestion or channel conditions, the network layer treats all decoding errors as erasures regardless of the cause. This allows us to view the system at the network layer as transmission over memoryless erasure channel. We study the throughput optimization and code design across the layers under a total code length constraint while taking also into account the network layer imperfections in the transmission. We use random coding error exponents to achieve results that do not depend on specific coding scheme used. The proposed scheme provides also means for investigating important physical layer phenomena, such as, channel model and lower layer error correction coding in the packet erasure models. Our approach extends to fading channels and networks of multiple nodes and by viewing the two layers of coding as a concatenated coding scheme, a comparison between layer-by-layer and joint cross-layer rate optimization can be made, as outlined in this paper","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127717673","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523633
J. Jaldén, B. Ottersten
The sphere decoder has emerged as one of the most promising techniques for maximum likelihood detection of symbols transmitted over a general MIMO channel. Although efficient for problems of moderate size it is known that the original sphere decoder is of exponential (expected) complexity which limits its usage for large scale problems. However, at this stage, many alterations and improvements over the original algorithm have appeared in the literature. Herein we study a generic sphere decoder for the i.i.d. Rayleigh fading MIMO channel. The detection ordering and search radius (parameters of the algorithm) are allowed to be arbitrary functions of the decoder input, the only restriction being that the search radius is chosen such that the detection problem is solved. It is shown that the set of problem instances solvable by the sphere decoder in less than exponential time would tend to zero with increasing problem size. This extends previous results by providing a statement which is stronger than exponential expected complexity while relaxing the assumptions regarding the specific decoder implementation.
{"title":"On the limits of sphere decoding","authors":"J. Jaldén, B. Ottersten","doi":"10.1109/ISIT.2005.1523633","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523633","url":null,"abstract":"The sphere decoder has emerged as one of the most promising techniques for maximum likelihood detection of symbols transmitted over a general MIMO channel. Although efficient for problems of moderate size it is known that the original sphere decoder is of exponential (expected) complexity which limits its usage for large scale problems. However, at this stage, many alterations and improvements over the original algorithm have appeared in the literature. Herein we study a generic sphere decoder for the i.i.d. Rayleigh fading MIMO channel. The detection ordering and search radius (parameters of the algorithm) are allowed to be arbitrary functions of the decoder input, the only restriction being that the search radius is chosen such that the detection problem is solved. It is shown that the set of problem instances solvable by the sphere decoder in less than exponential time would tend to zero with increasing problem size. This extends previous results by providing a statement which is stronger than exponential expected complexity while relaxing the assumptions regarding the specific decoder implementation.","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132788756","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523688
Jung-Soo Chung, Young-Sik Kim, Tae-Hyung Lim, Jong-Seon No, Habong Chung
In this paper, we derive the cyclotomic numbers of order 5 over an extension field Fpn using the well-known results of quintic Jacobi sums over Fp (B. C. Berndt, et al., 1998). For p ne 1 mod 5, we have obtained the simple closed-form expression of the cyclotomic numbers of order 5 over Fpn. For p equiv 1 mod 5, we express the cyclotomic number of order 5 over F pn in terms of the solution of the diophantine system which is required to evaluate the cyclotomic number of order 5 over Fpn. Using the cyclotomic numbers of order 5 over Fpn, autocorrelation distributions of 5-ary Sidel'nikov sequences of period pn - 1 are also derived
在本文中，我们利用著名的Fp上的五次Jacobi和的结果(b.c.b Berndt, et al.， 1998)，导出了扩展域Fp n上5阶的环切数。pne 1国防部5,我们获得的简单的封闭表达式分圆的数量的订单5 / Fp n。p 1国防部5枚,我们表达的割圆数量订购5 / F p n的丢番图系统的解决方案,需要评估分圆的数量的订单5 / Fp n。使用分圆的数量的订单5 / Fp n,自相关分布5-ary Sidel 'nikov pn - 1序列也派生
{"title":"Cyclotomic numbers of order 5 over F/sub p//sup n/","authors":"Jung-Soo Chung, Young-Sik Kim, Tae-Hyung Lim, Jong-Seon No, Habong Chung","doi":"10.1109/ISIT.2005.1523688","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523688","url":null,"abstract":"In this paper, we derive the cyclotomic numbers of order 5 over an extension field F<sub>p</sub> <sup>n</sup> using the well-known results of quintic Jacobi sums over F<sub>p</sub> (B. C. Berndt, et al., 1998). For p ne 1 mod 5, we have obtained the simple closed-form expression of the cyclotomic numbers of order 5 over F<sub>p</sub> <sup>n</sup>. For p equiv 1 mod 5, we express the cyclotomic number of order 5 over F <sub>p</sub> <sup>n</sup> in terms of the solution of the diophantine system which is required to evaluate the cyclotomic number of order 5 over F<sub>p</sub> <sup>n</sup>. Using the cyclotomic numbers of order 5 over F<sub>p</sub> <sup>n</sup>, autocorrelation distributions of 5-ary Sidel'nikov sequences of period p<sup>n</sup> - 1 are also derived","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133633206","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523659
L. Hanlen, A. Grant
We give an optimality condition for the input covariance for arbitrary ergodic Gaussian vector channels under the condition that the channel gains are independent of the transmit signal, the transmitter has knowledge of the channel gain probability law and the receiver has knowledge of each channel realization. Using this optimality condition, we find an iterative algorithm for numerical computation of optimal input covariance matrices
{"title":"Optimal transmit covariance for MIMO channels with statistical transmitter side information","authors":"L. Hanlen, A. Grant","doi":"10.1109/ISIT.2005.1523659","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523659","url":null,"abstract":"We give an optimality condition for the input covariance for arbitrary ergodic Gaussian vector channels under the condition that the channel gains are independent of the transmit signal, the transmitter has knowledge of the channel gain probability law and the receiver has knowledge of each channel realization. Using this optimality condition, we find an iterative algorithm for numerical computation of optimal input covariance matrices","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131785411","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523295
S. Sigurjonsson, Young-Han Kim
We extend Shannon's result on the capacity of channels with state information to multiple user channels. More specifically, we characterize the capacity (region) of degraded broadcast channels and physically degraded relay channels where the channel state information is causally available at the transmitters. We also obtain inner and outer bounds on the capacity region for multiple access channels with causal state information at the transmitters
{"title":"On multiple user channels with state information at the transmitters","authors":"S. Sigurjonsson, Young-Han Kim","doi":"10.1109/ISIT.2005.1523295","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523295","url":null,"abstract":"We extend Shannon's result on the capacity of channels with state information to multiple user channels. More specifically, we characterize the capacity (region) of degraded broadcast channels and physically degraded relay channels where the channel state information is causally available at the transmitters. We also obtain inner and outer bounds on the capacity region for multiple access channels with causal state information at the transmitters","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131858571","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}
Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523339
A. D'yachkov, A. Macula, T. Renz, P. Vilenkin, I. K. Ismagilov
For q-ary n-sequences, we develop the concept of similarity functions that can be used (for q = 4) to model a thermodynamic similarity on DNA sequences. A similarity function is identified by the length of a longest common subsequence between two q-ary n-sequences. Codes based on similarity functions are called DNA codes. DNA codes are important components in biomolecular computing and other biotechnical applications that employ DNA hybridization assays. We present our unpublished results connected with the conventional deletion similarity function used in the theory of error-correcting codes. The main aim of this paper - to obtain lower bounds on the rate of optimal DNA codes for a biologically motivated similarity function called a similarity of blocks. We also present constructions of suboptimal DNA codes based on the parity-check code detecting one error in the Hamming metric
{"title":"New results on DNA codes","authors":"A. D'yachkov, A. Macula, T. Renz, P. Vilenkin, I. K. Ismagilov","doi":"10.1109/ISIT.2005.1523339","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523339","url":null,"abstract":"For q-ary n-sequences, we develop the concept of similarity functions that can be used (for q = 4) to model a thermodynamic similarity on DNA sequences. A similarity function is identified by the length of a longest common subsequence between two q-ary n-sequences. Codes based on similarity functions are called DNA codes. DNA codes are important components in biomolecular computing and other biotechnical applications that employ DNA hybridization assays. We present our unpublished results connected with the conventional deletion similarity function used in the theory of error-correcting codes. The main aim of this paper - to obtain lower bounds on the rate of optimal DNA codes for a biologically motivated similarity function called a similarity of blocks. We also present constructions of suboptimal DNA codes based on the parity-check code detecting one error in the Hamming metric","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134450818","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：