On a class of repeated root monomial like abelian codes

Download
index.pdf
2015-04-01
Martinez Moro, Edgar
Özadam, Hakan
Özbudak, Ferruh
szabo, steve
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
32
views
0
downloads
In this paper we study polycyclic codes of length p s 1 × ⋯ × p s n p ​s ​1 ​​ ​​ ×⋯×p ​s ​n ​​ ​​ \ over $\F_{p^a}$\ generated by a single monomial. These codes form a special class of abelian codes. We show that these codes arise from the product of certain single variable codes and we determine their minimum Hamming distance. Finally we extend the results of Massey et. al. in \cite{MASSEY_1973} on the weight retaining property of monomials in one variable to the weight retaining property of monomials in several variables.
Repeated-root Cyclic code, Abelian code, Weight-retaining property
https://hdl.handle.net/11511/42513
Journal of Algebra Combinatorics Discrete Structures and Applications
Department of Mathematics, Article

Suggestions

The Minimum Hamming Distance of Cyclic Codes of Length 2ps
ÖZADAM, Hakan; Özbudak, Ferruh (2009-06-12)
We study cyclic codes of length 2p(s) over F-q where p is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.
ON THE k-TH ORDER LFSR SEQUENCE WITH PUBLIC KEY CRYPTOSYSTEMS
KIRLAR, Barış Bülent; Cil, Melek (Walter de Gruyter GmbH, 2017-06-01)
In this paper, we propose a novel encryption scheme based on the concepts of the commutative law of the k-th order linear recurrences over the finite field F-q for k > 2. The proposed encryption scheme is an ephemeral-static, which is useful in situations like email where the recipient may not be online. The security of the proposed encryption scheme depends on the difficulty of solving some Linear Feedback Shift Register (LFSR) problems. It has also the property of semantic security. For k = 2, we propose ...
On some bounds on the minimum distance of cyclic codes over finite fields
Özbudak, Ferruh; YAYLA, Oguz (2015-08-01)
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bounds on the minimum distance of cyclic codes over finite fields. Here we present some results on a generalization of this method. Then we apply it to several examples of cyclic codes and compare some known bounds with the bounds obtained by this generalization.
A Bound on the Minimum Distance of Quasi-cyclic Codes
Gueneri, Cem; Özbudak, Ferruh (2012-01-01)
We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and index l, where m is relatively prime to q. The bound involves the minimum distances of constituent codes of length l as well as the minimum distances of certain cyclic codes of length m which are related to the fields over which the constituents are defined. We present examples which show that the bound is sharp in many instances. We also compare the performance of our bound against the bounds of Lally and Es...
On the Krall-type polynomials on q-quadratic lattices
Alvarez-Nodarse, R.; Adiguzel, R. Sevinik (Elsevier BV, 2011-08-01)
In this paper, we study the Krall-type polynomials on non-uniform lattices. For these polynomials the second order linear difference equation, q-basic series representation and three-term recurrence relations are obtained. In particular, the q-Racah-Krall polynomials obtained via the addition of two mass points to the weight function of the non-standard q-Racah polynomials at the ends of the interval of orthogonality are considered in detail. Some important limit cases are also discussed. (C) 2011 Royal Net...
Citation Formats
E. Martinez Moro, H. Özadam, F. Özbudak, and s. szabo, “On a class of repeated root monomial like abelian codes,” Journal of Algebra Combinatorics Discrete Structures and Applications, pp. 75–84, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42513.
METU IIS - Integrated Information Service open@metu.edu.tr