Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Constructions of maximum rank distance codes, cyclic constant dimension codes, and subspace packings
Download
index.pdf
Date
2018
Author
Otal, Kamil
Metadata
Show full item record
Item Usage Stats
208
views
87
downloads
Cite This
In this thesis, we aim to introduce main contributions to solve three main problems in coding theory. The first problem investigates the construction of inequivalent maximum rank distance (MRD) codes. Namely, we look for the constructions of the largest possible sets of $mtimes n$ matrices over a finite field $F_q$, such that the rank of the subtraction of any two different matrices in the set cannot be smaller than a certain number. Constructions of such codes under a suitable equivalence notion have taken a worthwhile attention in the last decade due to their applications in many areas, and most of the constructions including also our works have been discovered in last few years. We introduce these outcomes classifying them considering the main and most general equivalence idea. We basically use the language of linearized polynomials in this direction as usual in many works in the literature. The second problem, which is originated from an application related to the efficiency in random network coding, concerns the construction of large cyclic subspace codes of constant dimension. In this set up, we aim to construct large sets of $k$-dimensional subspaces of $F_q^n$ in a way that any two distinct subspaces cannot be close to each other more than a certain number in terms of the subspace distance, and the cyclic shifts of each subspace must be included in the set. We give the only systematic construction of such sets in the literature utilizing linearized polynomials again but in a slightly different way. We note that the basic structure of this construction was proposed in our another work. Additionally, we summarize the history of the solution and some further remarks. In the last problem, we focus on the constructions of subspace packings, which are the $q$-analogue of packing designs. This notion is a natural generalization of constant dimension codes, and has applications in the analysis of different network codes. We give a recursive construction of such codes using a generalization of the linkage construction rather than linearized polynomials. In particular, we make use of the matrix version of MRD codes together with some facts from linear algebra. This result is one of the main outcomes of our recent work. We express that these problems are different from but substantially related to each other. Connections among them are also expressed in related places. Furthermore, we remark that various areas of mathematics are used to solve these problems in general, e.g. finite geometry, algebraic geometry, algebra, and linear algebra. Therefore, it is not easy to introduce all advances properly with their complete preliminary information here. Moreover, we try to keep our language as simple as possible, and follow the historical journey of the advances. In that way, we target that this thesis can addresses to a more general reader group.
Subject Keywords
Coding theory.
,
Polynomials.
URI
http://etd.lib.metu.edu.tr/upload/12622864/index.pdf
https://hdl.handle.net/11511/27846
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
Computing cryptographic properties of Boolean functions from the algebraic normal orm representation
Çalık, Çağdaş; Doğanaksoy, Ali; Department of Cryptography (2013)
Boolean functions play an important role in the design and analysis of symmetric-key cryptosystems, as well as having applications in other fields such as coding theory. Boolean functions acting on large number of inputs introduces the problem of computing the cryptographic properties. Traditional methods of computing these properties involve transformations which require computation and memory resources exponential in the number of input variables. When the number of inputs is large, Boolean functions are ...
Characterizations of Partially Bent and Plateaued Functions over Finite Fields
Mesnager, Sihem; Özbudak, Ferruh; SINAK, AHMET (2018-12-30)
Partially bent and plateaued functions over finite fields have significant applications in cryptography, sequence theory, coding theory, design theory and combinatorics. They have been extensively studied due to their various desirable cryptographic properties. In this paper, we study on characterizations of partially bent and plateaued functions over finite fields, with the aim of clarifying their structure. We first redefine the notion of partially bent functions over any finite field Fq , with q a prim...
Algebraic geometric methods in studying splines
Sipahi Ös, Neslihan; Bhupal, Mohan Lal; Altınok Bhupal, Selma; Department of Mathematics (2013)
In this thesis, our main objects of interest are piecewise polynomial functions (splines). For a polyhedral complex $\Delta$ in $\mathbb{\R}^n$, $C^{r}(\Delta)$ denotes the set of piecewise polynomial functions defined on $\Delta$. Determining the dimension of the space of splines with polynomials having degree at most $k$, denoted by $C^r_k(\Delta)$, is an important problem, which has many applications. In this thesis, we first give an exposition on splines and introduce different algebraic geometric metho...
Proof of the basic theorem on concept lattices in Isabelle/HOL
Sertkaya, Barış; Oğuztüzün, Mehmet Halit S.; Tiefenbach, Andreas; Department of Computer Engineering (2003)
Formel Concept Analysis is an emerging field of applied mathematics based on a lattice-theoretic formalization of the notions of concept and conceptual hierarchy. It thereby facilitates mathematical thinking for conceptual data analysis and knowledge processing. Isabelle, on the other hand, is a generic interactive theory development environment for implementing logical formalisms. It has been instantiated to support reasoning in several object-logics. Specialization of Isabelle for Higher Order Logic is ca...
On q-ary plateaued functions over F-q and their explicit characterizations
Mesnager, Sihem; Özbudak, Ferruh; Sinak, Ahmet; Cohen, Gerard (Elsevier BV, 2019-08-01)
Plateaued and bent functions play a significant role in cryptography, sequence theory, coding theory and combinatorics. In 1997, Coulter and Matthews redefined bent functions over any finite field F-q where q is a prime power, and established their properties. The objective of this work is to redefine the notion of plateaued functions over F-q, and to present several explicit characterizations of those functions. We first give, over F-q, the notion of q-ary plateaued functions, which relies on the concept o...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
K. Otal, “Constructions of maximum rank distance codes, cyclic constant dimension codes, and subspace packings,” Ph.D. - Doctoral Program, Middle East Technical University, 2018.