Geometric Approach to b-Symbol Hamming Weights of Cyclic Codes

Shi, Minjia
Özbudak, Ferruh
Sole, Patrick
IEEESymbol-pair codes were introduced by Cassuto and Blaum in 2010 to protect pair errors in symbol-pair read channels. Recently Yaakobi, Bruck and Siegel (2016) generalized this notion to b-symbol codes in order to consider consecutive b errors for a prescribed integer b ≥ 2, and they gave constructions and decoding algorithms. Cyclic codes were considered by various authors as candidates for symbol-pair codes and they established minimum distance bounds on (certain) cyclic codes. In this paper we use algebraic curves over finite fields in order to obtain tight lower and upper bounds on b-symbol Hamming weights of arbitrary cyclic codes over Fq. Here b ≥ 2 is an arbitrary prescribed positive integer and Fq is an arbitrary finite field. We also present a stability theorem for an arbitrary cyclic code C of dimension k and length n: the b-symbol Hamming weight enumerator of C is the same as the k-symbol Hamming weight enumerator of C if k ≤ b ≤ n - 1. Moreover, we give improved tight lower and upper bounds on b-symbol Hamming weights of some cyclic codes related to irreducible cyclic codes. Throughout the paper the length n is coprime to q.
IEEE Transactions on Information Theory


Modeling and synthesis of circular-sectoral arrays of log-periodic antennas using multilevel fast multipole algorithm and genetic algorithms
Ergül, Özgür Salih (American Geophysical Union (AGU), 2007-06-19)
Circular-sectoral arrays of log-periodic (LP) antennas are presented for frequency-independent operation and beam-steering capability. Specifically, nonplanar trapezoidal tooth LP antennas are considered in a circular array configuration, where closely spaced antennas occupy a sector of the circle. Electromagnetic interactions of the array elements, each of which is a complicated LP antenna structure, are rigorously computed with the multilevel fast multipole algorithm (MLFMA). Genetic algorithms (GAs) are ...
Backward stochastic differential equations and their applications to stochastic control problems
Nalbant, Hanife Sevda; Yolcu Okur, Yeliz; Hayfavi, Azize; Department of Financial Mathematics (2013)
Backward stochastic di fferential equations (BSDE) were firstly introduced by Bismut in 1973. Following decades, it has been great interest all over the world and appeared in numerious areas such as pricing and hedging claims, utility theory and optimal control theory. In 1997, El Karoui, Peng and Quenez brought together their brilliant studies in the article Backward Stochastic Di fferential Equations in Finance. They considered an adapted solution pair (Y,Z) of the following BSDE: -dY_t = f(t, Y_t,Z_t)dt ...
Nonlinear congruential pseudorandom number generators based on inversions have been introduced and analysed recently. These generators do not show the simple lattice structure of the widely used linear congruential generators which are too regular for certain simulation purposes. In the present paper a nonlinear congruential generator based on inversions with respect to a power of two modulus is considered. It is shown that the set of points formed by consecutive pseudorandom numbers has a more complicated ...
Robust time series: Some engineering applications
Tiku, ML; Kestel, Sevtap Ayşe (2000-01-01)
AR(1) models in time series with nonnormal errors represented by two families of distributions: (i) Gamma with support IR:(0,infinity), and (ii) Student's t with support IR:(-infinity,infinity) are considered. Since the maximum likelihood (ML) estimators are intractable, the modified maximum likelihood (MML) estimators of the parameters are derived and it is shown that they are remarkably efficient besides being easy to compute. It is also shown that the least squares (LS) estimators have very low efficienc...
Belief propagation decoding of polar codes under factor graph permutations
Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018)
Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...
Citation Formats
M. Shi, F. Özbudak, and P. Sole, “Geometric Approach to b-Symbol Hamming Weights of Cyclic Codes,” IEEE Transactions on Information Theory, pp. 0–0, 2021, Accessed: 00, 2021. [Online]. Available: