On some bounds on the minimum distance of cyclic codes over finite fields

2015-08-01
Özbudak, Ferruh
YAYLA, Oguz
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
168
views
0
downloads
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.
Bounds on the minimum distance, Cyclic codes, Zeh-Bezzateev bound, Zeh-Zeh-Bezzateev bound
https://hdl.handle.net/11511/47058
DESIGNS CODES AND CRYPTOGRAPHY
Department of Mathematics, Article

Suggestions

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...
Two dimensional finite volume weighted essentially non-oscillatory euler schemes with uniform and non-uniform grid coefficients
Elfarra, Monier Ali; Akmandor, İbrahim Sinan; Department of Aerospace Engineering (2005)
In this thesis, Finite Volume Weighted Essentially Non-Oscillatory (FV-WENO) codes for one and two-dimensional discretised Euler equations are developed. The construction and application of the FV-WENO scheme and codes will be described. Also the effects of the grid coefficients as well as the effect of the Gaussian Quadrature on the solution have been tested and discussed. WENO schemes are high order accurate schemes designed for problems with piecewise smooth solutions containing discontinuities. The key ...
Inverse Sturm-Liouville Systems over the whole Real Line
Altundağ, Hüseyin; Taşeli, Hasan; Department of Mathematics (2010)
In this thesis we present a numerical algorithm to solve the singular Inverse Sturm-Liouville problems with symmetric potential functions. The singularity, which comes from the unbounded domain of the problem, is treated by considering the limiting case of the associated problem on the symmetric finite interval. In contrast to regular problems which are considered on a finite interval the singular inverse problem has an ill-conditioned structure despite of the limiting treatment. We use the regularization t...
Error analysis for the numerical evaluation of the diagonal forms of the scalar spherical addition theorem
Koc, S; Song, JM; Chew, WC (Society for Industrial & Applied Mathematics (SIAM), 1999-04-29)
The numerical solution of wave scattering from large objects or from a large cluster of scatterers requires excessive computational resources and it becomes necessary to use approximate-but fast-methods such as the fast multipole method; however, since these methods are only approximate, it is important to have an estimate for the error introduced in such calculations. An analysis of the error for the fast multipole method is presented and estimates for truncation and numerical integration errors are obtain...
Development of an incompressible navier-stokes solver with alternating cell direction implicit method on structured and unstructured quadrilateral grids
Baş, Onur; Tuncer, İsmail Hakkı; Department of Aerospace Engineering (2007)
In this research, the Alternating Cell Direction Implicit method is used in temporal discretisation of the incompressible Navier-Stokes equations and compared with the well known and widely used Point Gauss Seidel scheme on structured and quadrilateral unstructured meshes. A two dimensional, laminar and incompressible Navier-Stokes solver is developed for this purpose using the artificial compressibility formulation. The developed solver is used to obtain steady-state solutions with implicit time stepping m...
Citation Formats
F. Özbudak and O. YAYLA, “On some bounds on the minimum distance of cyclic codes over finite fields,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 173–178, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47058.
METU IIS - Integrated Information Service open@metu.edu.tr