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
A concatenated construction of linear complementary pair of codes
Date
2019-09-01
Author
GÜNERİ, CEM
Özbudak, Ferruh
Sacikara, Elif
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
218
views
0
downloads
Cite This
A concatenated construction for linear complementary dual codes was given by Carlet et al. using the so-called isometry inner codes. Here, we obtain a concatenated construction to the more general family, linear complementary pair of codes. Moreover, we extend the dual code description of Chen et al. for concatenated codes to duals of generalized concatenated codes. This allows us to use generalized concatenated codes for the construction of linear complementary pair of codes.
Subject Keywords
Computer Networks and Communications
,
Computational Theory and Mathematics
,
Applied Mathematics
URI
https://hdl.handle.net/11511/38157
Journal
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES
DOI
https://doi.org/10.1007/s12095-019-0354-5
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
On affine variety codes from the Klein quartic
Geil, Olav; Özbudak, Ferruh (Springer Science and Business Media LLC, 2019-03-01)
We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in Kolluru et al., (Appl. Algebra Engrg. Comm. Comput. 10(6):433-464, 2000, Ex. 3.2). Among the codes that we construct almost all have parameters as good as the best known codes according to Grassl (2007) and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound (Geil and HOholdt, IEEE Trans. Inform. The...
Strongly regular graphs arising from non-weakly regular bent functions
Özbudak, Ferruh (Springer Science and Business Media LLC, 2019-11-01)
In this paper, we study two special subsets of a finite field of odd characteristics associated with non-weakly regular bent functions. We show that those subsets associated to non-weakly regular even bent functions in the GMMF class (see cesmelioglu et al. Finite Fields Appl. 24, 105-117 2013) are never partial difference sets (PDSs), and are PDSs if and only if they are trivial subsets. Moreover, we analyze the two known sporadic examples of non-weakly regular ternary bent functions given in Helleseth and...
A nested iterative scheme for computation of incompressible flows in long domains
Manguoğlu, Murat; Tezduyar, Tayfun E.; Sathe, Sunil (Springer Science and Business Media LLC, 2008-12-01)
We present an effective preconditioning technique for solving the nonsymmetric linear systems encountered in computation of incompressible flows in long domains. The application category we focus on is arterial fluid mechanics. These linear systems are solved using a nested iterative scheme with an outer Richardson scheme and an inner iteration that is handled via a Krylov subspace method. Test computations that demonstrate the robustness of our nested scheme are presented.
Results on symmetric S-boxes constructed by concatenation of RSSBs
KAVUT, SELÇUK; Baloglu, Sevdenur (Springer Science and Business Media LLC, 2019-07-01)
In this paper, we first present an efficient exhaustive search algorithm to enumerate 6 x 6 bijective S-boxes with the best-known nonlinearity 24 in a class of S-boxes that are symmetric under the permutation (x) = (x(0), x(2), x(3), x(4), x(5), x(1)), where x = (x(0), x1,...,x5)?26. Since any S-box S:?26?26 in this class has the property that S((x)) = (S(x)) for every x, it can be considered as a construction obtained by the concatenation of 5 x 5 rotation-symmetric S-boxes (RSSBs). The size of the search ...
A new representation of the Dedekind completion of C(K)-spaces
Ercan, Z; Onal, S (American Mathematical Society (AMS), 2005-01-01)
A new representation of the Dedekind completion of C( K) is given. We present a necessary and sufficient condition on a compact Haus-dorff space K for which the Dedekind completion of C(K) is B(S), the space of real valued bounded functions on some set S.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. GÜNERİ, F. Özbudak, and E. Sacikara, “A concatenated construction of linear complementary pair of codes,”
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES
, pp. 1103–1114, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38157.