Some new quasi cyclic self dual codes

Date

2016-06-24

Author

Çomak, Pınar
Kim, Jon Lark
Özbudak, Ferruh

Metadata

Show full item record

Item Usage Stats

49
views

0
downloads

URI

https://hdl.handle.net/11511/73509
http://www.math.bas.bg/moiuser/~ACCT2016/p16.pdf

Conference Name

15th International Workshop on Algebraic and Combinatorial Coding Theory

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Some refined Schwarz-Pick lemmas Kaptanoglu, HT (2002-01-01)
Some New Bounds on Closed Ordinal Ramsey Numbers Sağlam, Irmak; Kaya, Burak; Department of Mathematics (2020-12-22) Partition calculus on ordinals was introduced by Erd ̋os and Rado and is a well-studiedsubject. Later on, Baumgartner extended this investigation to topological spaces andstudied topological partition relations on ordinal spaces.In recent years, closed and topological partition relations on ordinals have been anactive area of research. This thesis is a contribution to the study of closed ordinalRamsey numbers. More specifically, we provide new lower and upper bounds forclosed ordinal Ramsey numbers of p...
Some New Completeness Properties in Topological Spaces Vural, Çetin; Önal, Süleyman (null; 2017-06-30) One of the most widely known completeness property is the completeness of metric spaces and the other one being of a topological space in the sense of Cech. It is well known that a metrizable space X is completely metrizable if and only if X is Cech-complete. One of the generalisations of completeness of metric spaces is subcompactness. It has been established that, for metrizable spaces, subcompactness is equivalent to Cech-completeness. Also the concept of domain representability can be considered as a co...
Some new results on binary polynomial multiplication Cenk, Murat (2015-11-01) This paper presents several methods for reducing the number of bit operations for multiplication of polynomials over the binary field. First, a modified Bernstein's 3-way algorithm is introduced, followed by a new 5-way algorithm. Next, a new 3-way algorithm that improves asymptotic arithmetic complexity compared to Bernstein's 3-way algorithm is introduced. This new algorithm uses three multiplications of one-third size polynomials over the binary field and one multiplication of one-third size polynomials ...
Some splitting theorems for stably causal spacetime Garcia-Rio, E; Kupeli, DN (Springer Science and Business Media LLC, 1998-01-01) We prove a splitting theorem for stably causal spacetimes and another splitting theorem for finitely compact spacetimes admitting a proper time synchronizable reference frame.

Citation Formats

P. Çomak, J. L. Kim, and F. Özbudak, “Some new quasi cyclic self dual codes,” presented at the 15th International Workshop on Algebraic and Combinatorial Coding Theory, Albena, Bulgaria, 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/73509.