检索结果-内蒙古大学图书馆

List decoding of algebraic-geometric codes

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第2期45卷 432-437页

作者： Shokrollahi, MA Wasserman, H AT&T Bell Labs Murray Hill NJ 07974 USA Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

We generalize Sudan's results for Reed-Solomon codes to the class of algebraic-geometric codes, designing algorithms for list decoding of algebraic geometric codes which can decode beyond the conventional error-correction bound (d - 1)/2, d being the minimum distance of the code. Our main algorithm is based on an interpolation scheme and factorization of polynomials over algebraic function fields, For the latter problem we design a polynomial-time algorithm and show that the resulting overall list-decoding algorithm runs in polynomial time under some mild conditions. Several examples are included.

关键词： algebraic function fields algebraic-geometric codes decoding algorithms factorization of polynomials Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

Safety and reliability of comma-free digital coding for railway track circuits

引用

IEE PROCEEDINGS-ELECTRIC POWER APPLICATIONS 1999年第3期146卷 350-360页

作者： Hill, RJ Bouillevaux, J Univ Bath Dept Elect & Elect Engn Bath BA2 7AY Avon England Ecole Natl Super Elect & Mechan Inst Natl Polytech Lorraine F-54516 Vandoeuvre Nancy France

A methodology for quantifying the safety and reliability performance of comma-free codes for railway track circuit data transmission under high levels of Gaussian noise is presented. Two decoding algorithms are described, based on the correct reception of one and two consecutive codewords, respectively. It is shown that use of the second algorithm in conjunction with a sub-dictionary with a minimum word distance constraint gives comparable safety and reliability performances to those obtained using longer-length synchronisable error-detecting codes. The paper also contains an outline of the properties of traction noise, knowledge of which is necessary for the design of digital railway data transmission systems.

关键词： digital railway data transmission systems electromagnetic interference Railway industry Traffic engineering computing rail traffic Control engineering computing Control technology and theory traction noise Reliability Electromagnetic compatibility and interference Rail-traffic system control traction railway track circuits comma-free digital coding safety performance railways reliability performance Telemetry traffic control Health and safety aspects reliability railway telecontrol decoding algorithms codewords encoding Instrumentation Telecontrol and telemetering components Maintenance and reliability safety EMI Gaussian noise Transportation Plant engineering, maintenance and safety Codes telecontrol minimum word distance constraint

来源：评论

学校读者我要写书评

暂无评论

Fast decoding algorithms for first order reed-muller and related codes

引用

Designs, Codes, and Cryptography 1996年第3期7卷 187-187页

作者： Ashikhmin, Alexey E. Litsyn, Simon N. Institute for Problems of Information Transmission Moscow Russia Department of Electrical Engineering-Systems Tel Aviv University Ramat Aviv Israel

Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value calculations are used in the algorithms. Soft and hard decisions maximum likelihood decoding algorithms for first order Reed-Muller and the Nordstrom-Robinson codes with low complexity are proposed.

关键词： decoding algorithms First order Reed-Muller codes The Nordstrom-Robinson code

来源：评论

学校读者我要写书评

暂无评论

On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第1期44卷 162-171页

作者： Banihashemi, AH Khandani, AK Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain gamma of L, and are obtained based on a decoding algorithm Which is an improved version of Kannan's method, The tatter is currently the fastest known method for the decoding of a general lattice, For the decoding of a point x, the proposed algorithm recursively searches inside an n-dimensional rectangular parallelepiped (cube), centered at x, With its edges along the Gram-Schmidt vectors of a proper basis of L. We call algorithms of this type recursive cube search (RCS) algorithms. It is shown that Kannan's algorithm also belongs to this category, The complexity of RCS algorithms is measured in terms of the number of lattice points that need to be examined before a decision is made, To tighten the upper bound on the complexity, We select a lattice basis which is reduced in the sense of Korkin-Zolotarev, It is shown that for any selected basis, the decoding complexity (using RCS algorithms) of any sequence of lattices with possible application in communications (gamma greater than or equal to 1) grows at least exponentially with n and gamma. It is observed that the densest lattices, and almost all of the lattices used in communications, e.g., Barnes-Wall lattices and the Leech lattice, have equal successive minima (ESR I). For the decoding complexity of ESM lattices, a tighter upper bound and a stronger loner bound result are derived.

关键词： coding gain decoding algorithms decoding complexity densest lattices Korkin-Zolotarev reduction lattices successive minima

来源：评论

学校读者我要写书评

暂无评论

Suboptimal soft-decision decoding for some RS-codes

引用

ELECTRONICS LETTERS 1998年第10期34卷 983-984页

作者： Wesemeyer, S Sweeney, P Univ Surrey Ctr Commun Syst Res Guildford GU2 5XH Surrey England

A novel soft-decision algorithm is presented for Reed-Solomon (RS) codes, based on the reordering of the symbols of the received word according to some measure of reliability. The simulation results show that improvements in coding gain of > 1 dB are possible when compared to similar decoding algorithms using unsorted received words.

关键词： decoding algorithms Reed-Solomon codes Codes suboptimal soft-decision decoding reliability symbol reordering RS-codes decoding coding gain

来源：评论

学校读者我要写书评

暂无评论

Algebraic-geometry codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第6期44卷 2596-2618页

作者： Blake, I Heegard, C Hoholdt, T Wei, V Hewlett Packard Labs Palo Alto CA 94304 USA Cornell Univ Sch Elect Engn Ithaca NY 14853 USA Tech Univ Denmark Inst Math DK-2800 Lyngby Denmark Chinese Univ Hong Kong Dept Informat Engn Shatin New Territory Peoples R China

The theory of error-correcting codes derived from curves in an algebraic geometry was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), and Goppa codes. The development of the theory has received intense consideration since that time and the purpose of the paper is to review this work. Elements of the theory of algebraic curves, at a level sufficient to understand the code constructions and decoding algorithms, are introduced. Code constructions from particular classes of curves, including the Klein quartic, elliptic, and hyperelliptic curves, and Hermitian curves, are presented, decoding algorithms for these classes of codes, and others, are considered. The construction of classes of asymptotically good codes using modular curves is also discussed.

关键词： algebraic curves algebraic-geometry codes asymptotically good codes decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Huffman decoding

引用

INFORMATION PROCESSING LETTERS 1997年第2期61卷 97-99页

作者： Chung, KL Department of Information Management National Taiwan Institute of Technology No. 43 Section 4 Keelung Road Taipei Taiwan 10672

关键词： data structures decoding algorithms Huffman code

来源：评论

学校读者我要写书评

暂无评论

On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第5期43卷 1477-1488页

作者： Kamiya, N C&C Research Laboratories NEC Corporation Limited Kawasaki Japan

We describe an efficient algorithm for successive errors-and-erasures decoding of BCH codes, The decoding algorithm consists of finding all necessary error locator polynomials and errata evaluator polynomials, choosing the most appropriate error locator polynomial and errata evaluator polynomial, using these two polynomials to compute a candidate codeword for the decoder output, and testing the candidate for optimality,ia an originally developed acceptance criterion, Even in the most stringent case possible, the acceptance criterion is only a little more stringent than Forney's criterion for GMD decoding, We present simulation results on the error performance of our decoding algorithm for binary antipodal signals over an AWGN channel and a Rayleigh fading channel, The number of calculations of elements in a finite field that are required by our algorithm is only slightly greater than that required by hard-decision decoding, while error performance is almost as good as that achieved with GMD decoding, The presented algorithm is also applicable to efficient decoding of product RS codes.

关键词： decoding algorithms decoding complexity generalized minimum-distance decoding Reed-Solomon codes soft decisions successive errors-and-erasures decoding

来源：评论

学校读者我要写书评

暂无评论

Bounded distance plus 1 soft-decision Reed-Solomon decoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1996年第3期42卷 704-720页

作者： Berlekamp, E Hazelnut Berkeley CA USA

We present a new Reed-Solomon decoding algorithm, which embodies several refinements of an earlier algorithm. Some portions of this new decoding algorithm operate on symbols of length Igq bits;other portions operate on somewhat longer symbols. In the worst case, the total number of calculations required by the new decoding algorithm is proportional to nr, where n is the code's block length and r is its redundancy. This worst case workload is very similar to prior algorithms. But in many applications, average-case workload and error-correcting performance are both much better. The input to the new algorithm consists of n received symbols from GF(q), and rr nonnegative real numbers, each of which is the reliability of the corresponding received symbol. Any conceivable errata pattern has a ''score'' equal to the sum of the reliabilities of its locations with nonzero errata values. A max-likelihood decoder would find the minimum score over all possible errata patterns. Our new decoding algorithm finds the minimum score only over a subset of these possible errata patterns. The errata within any candidate errata pattern may be partitioned into ''errors'' and ''erasures,'' depending on whether the corresponding reliabilities are above or below an ''erasure threshold.'' Different candidate errata patterns may have different thresholds, each chosen to minimize its corresponding ERRATA COUNT, which is defined as 2 . (number of errors) c (number of erasures). The new algorithm finds an errata pattern with minimum score among all errata patterns for which ERRATA COUNT less than or equal to r + 1 where r is the redundancy of the RS code. This is one check symbol better than conventional RS decoding algorithms. Conventional algorithms also require that the erasure threshold be set a priori;the new algorithm obtains the best answer over all possible settings of the erasure threshold. Conventional cyclic RS codes have length n = q - 1, and their locations correspond to the nonzero

关键词： decoding algorithms Reed-Solomon codes soft decisions doubly extended codes algebraic decoding decoding beyond half minimum distance probabilistic decoding best case decoding queued decoding Generalized Minimum Distance decoding bounded distance decoding

来源：评论

学校读者我要写书评

暂无评论

FAST PARALLEL algorithms FOR decoding REED-SOLOMON CODES BASED ON REMAINDER POLYNOMIALS

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1995年第4期41卷 873-885页

作者： DABIRI, D BLAKE, IF Univ of Waterloo Waterloo Ont Can

The problem of decoding cyclic error correcting codes is one of solving a constrained polynomial congruence, often achieved using the Berlekamp-Massey or the extended Euclidean algorithm on a key equation involving the syndrome polynomial. A module-theoretic approach to the solution of polynomial congruences is developed here using the notion of exact sequences. This technique is applied to the Welch-Berlekamp key equation for decoding Reed-Solomon codes for which the computation of syndromes is not required. It leads directly to new and efficient parallel decoding algorithms that can be realized with a systolic array. The architectural issues for one of these parallel decoding algorithms are examined in some detail.

关键词： REED-SOLOMON CODES decoding algorithms SYSTOLIC ARRAYS WELCH-BERLEKAMP EQUATIONS MODULES

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：