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
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
Construction of self dual codes from graphs
Date
2022-07-01
Author
Fellah, Nazahet
Guenda, Kenza
Özbudak, Ferruh
Seneviratne, Padmapani
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
10
views
0
downloads
Cite This
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 are extremal.
Subject Keywords
Paley-type bipartite graphs
,
Hadamard matrices
,
Self-dual codes
,
Extremal doubly even codes
,
MATRICES
URI
https://hdl.handle.net/11511/100698
Journal
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
DOI
https://doi.org/10.1007/s00200-022-00567-2
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
Belief propagation decoding of polar codes under factor graph permutations
Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018)
Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...
A new concatenated type construction for LCD codes and isometry codes
CARLET, Claude; Guneri, Cem; Özbudak, Ferruh; SOLÉ, Patrick (2018-03-01)
We give a new concatenated type construction for linear codes with complementary dual (LCD) over small finite fields. In this construction, we need a special class of inner codes that we call isometry codes. Our construction generalizes a recent construction of Carlet et al. (2014-2016) and of Gtineri et al. (2016). In particular, it allows us to construct LCD codes with improved parameters directly.
LCD codes from tridiagonal Toeplitz matrices
Shi, Minjia; Özbudak, Ferruh; Xu, Li; Solé, Patrick (2021-10-01)
Double Toeplitz (DT) codes are codes with a generator matrix of the form (I,T) with T a Toeplitz matrix, that is to say constant on the diagonals parallel to the main. When T is tridiagonal and symmetric we determine its spectrum explicitly by using Dickson polynomials, and deduce from there conditions for the code to be LCD. Using a special concatenation process, we construct optimal or quasi-optimal examples of binary and ternary LCD codes from DT codes over extension fields.
On decoding interleaved reed-solomon codes
Yayla, Oğuz; Özbudak, Ferruh; Department of Cryptography (2011)
Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher-Kiayias-Yung is extended to the polynomials whose degrees are allowed to be distinct. Furthermore, it is observed that probability of the algorithm can be increased. Specifically, for a finite field $\F$, we present a probabilistic algorithm which can recover polynomials $p_1,\ldots, p_r \in \F[x]$ of degree less than $k_1,k_2,\ldots,k_r$, respectively with given field evaluations $p_l(z_i) = y_{i,l}$ for all $i \in I$, $
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...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
N. Fellah, K. Guenda, F. Özbudak, and P. Seneviratne, “Construction of self dual codes from graphs,”
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
, pp. 0–0, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/100698.