Covering Radius of Melas Codes

Download

index.pdf

Date

2022-01-01

Author

Shi, Minjia
Helleseth, Tor
Özbudak, Ferruh
Sole, Patrick

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

200
views

57
downloads

IEEEWe prove that the covering radius of the Melas code M(m, q) of length n = qm - 1 over Fq is 2 if q > 3. We also prove that the covering radius of M(m, 3) is 3 is m ≥ 3, the covering radius of M(2, 3) is 4, and the covering radii of M(1, 2) and M(1, 3) are 1.

Subject Keywords

Codes, covering radius, finite fields, Indexes, Informatics, Mathematics, Melas code, Parity check codes, Signal processing, Testing

URI

https://hdl.handle.net/11511/97724

Journal

IEEE Transactions on Information Theory

DOI

https://doi.org/10.1109/tit.2022.3152092

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

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...
Invariant subspaces for Banach space operators with an annular spectral set Yavuz, Onur (2008-01-01) Consider an annulus Omega = {z epsilon C : r(0) 0 such that parallel to p(T)parallel to <= K sup{vertical bar p(lambda)vertical bar : vertical bar lambda vertical bar <= 1} and parallel to p(r(0)T(-1))parallel to <= K sup{vertical bar p(lambda)vertical bar : vertical bar lambda vertical bar <= 1} for all polynomials p. Then there exists a nontrivial common invariant subspace for T* and T*(-1).
On diamond products ensuring irreducibility of the associated composed product İrimağzi, Canberk; Özbudak, Ferruh (Informa UK Limited, 2023-2-16) Let f and g be two irreducible polynomials of coprime degrees m and n whose zeroes lie in a set G⊆F¯¯¯q . Let ⋄ be a diamond product on G. We define the weaker cancelation property of ⋄ and show that it is sufficient to conclude that the composed product of f and g derived from ⋄ is an irreducible polynomial of degree mn. We also prove that a wide class of diamond products on finite fields satisfy the weaker cancelation property. These results extend the corresponding results of Brawley and Carlitz (1987...
Factorization of Joint Probability Mass Functions into Parity Check Interactions Bayramoglu, Muhammet Fatih; Yılmaz, Ali Özgür (2009-07-03) We show that any joint probability mass function (PMF) can be expressed as a product of parity check factors an d factors of degree one with the help of some auxiliary variables, if the alphabet size is appropriate for defining a parity chec k equation. In other words, marginalization of a joint PMF is equivalent to a soft decoding task as long as a finite field can be constructed over the alphabet of the PMF. In factor graph terminology this claim means that a factor graph representing such a joint PMF alw...
An obstruction to finding algebraic models for smooth manifolds with prescribed algebraic submanifolds CELIKTEN, A; Ozan, Yıldıray (2001-03-01) Let N ⊆ M be a pair of closed smooth manifolds and L an algebraic model for the submanifold N. In this paper, we will give an obstruction to finding an algebraic model X of M so that the submanifold N corresponds in X to an algebraic subvariety isomorphic to L.

Citation Formats

M. Shi, T. Helleseth, F. Özbudak, and P. Sole, “Covering Radius of Melas Codes,” IEEE Transactions on Information Theory, pp. 0–0, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/97724.