On a class of repeated root monomial like abelian codes

Martinez Moro, Edgar
Özadam, Hakan
Özbudak, Ferruh
szabo, steve
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.
Journal of Algebra Combinatorics Discrete Structures and Applications


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.
Construction of self dual codes from graphs
Fellah, Nazahet; Guenda, Kenza; Özbudak, Ferruh; Seneviratne, Padmapani (2022-07-01)
In this work we define and study binary codes C-q,C-k and (C-q,C-k) over bar obtained from neighbor- hood designs of Paley-type bipartite graphs P(q, k) and their complements, respectively for q an odd prime. We prove that for some values of q and k the codes C-q,C-k are self-dual and the codes (C-q,C-k) over bar are self-orthogonal. Most of these codes tend to be with optimal or near optimal parameters. Next, we extend the codes C(q,k )to get doubly even self dual codes and find that most of these codes ar...
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 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...
On bounded and unbounded operators
Uyanık, Elif; Yurdakul, Murat Hayrettin; Department of Mathematics (2017)
In this thesis we study on bounded and unbounded operators and obtain some results by considering $ell$-K"{o}the spaces. As a beginning, we introduce some necessary and sufficient conditions for a Cauchy Product map on a smooth sequence space to be continuous and linear and we consider its transpose. We use the modified version of Zahariuta's method to obtain analogous results for isomorphic classification of Cartesian products of K"{o}the spaces. We also investigate the SCBS property and show that all sepa...
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.