English
Related papers

Related papers: Design of Two Dimensional Unipolar (Optical) Ortho…

200 papers

This paper describes a search algorithm to find multiple sets of one dimensional unipolar (optical) orthogonal codes characterized by parameters, binary code sequence of length (n bits) and weight w (number of bit 1s in the sequence) as…

Information Theory · Computer Science 2013-09-10 R. C. S. Chauhan , Y. N. Singh , R. Asthana

The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…

Combinatorics · Mathematics 2026-02-24 Xiuling Shan , Lidong Wang , Yanxun Chang , Xiaomiao Wang

Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing…

Combinatorics · Mathematics 2024-07-09 Dean Crnković , Keita Ishizuka , Hadi Kharaghani , Sho Suda , Andrea Švob

This paper proposes an algorithm to search a family of multiple sets of minimum correlated one dimensional uni-polar (optical) orthogonal codes (1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code parameters. The…

Information Theory · Computer Science 2024-11-12 Ram Chandra Singh Chauhan , Yatindra Nath Singh , Rachna Asthana

Optical orthogonal codes (OOCs) are sets of $(0,1)$-sequences with good auto- and cross-correlation properties. They were originally introduced for use in multi-access communication, particularly in the setting of optical CDMA…

Combinatorics · Mathematics 2025-01-15 Sophie Huczynska , Siaw-Lynn Ng

Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…

Information Theory · Computer Science 2020-03-18 Yansheng Wu , Yoonjin Lee

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

Information Theory · Computer Science 2009-11-03 Reza Omrani , Gagan Garg , P. Vijay Kumar , Petros Elia , Pankaj Bhambhani

In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…

Information Theory · Computer Science 2016-10-26 Minjia Shi , Lin Sok , Patrick Solé

In this paper, we are concerned about optimal two-dimensional optical orthogonal codes with $\lambda$ = 2. Some combinatorial constructions are presented and many infinite families of optimal two-dimensional optical orthogonal codes with…

Combinatorics · Mathematics 2013-12-31 Tao Feng , Yanxun Chang

We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…

Combinatorics · Mathematics 2022-07-18 Tim Alderson

Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…

Information Theory · Computer Science 2015-06-08 Steven T. Dougherty , Jon-Lark Kim , Buket Ozkaya , Lin Sok , Patrick Solé

Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…

Information Theory · Computer Science 2012-03-05 Sophie Morier-Genoud , Valentin Ovsienko

We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…

Information Theory · Computer Science 2024-05-30 Ferruh Ozbudak , Paolo Santonastaso , Ferdinando Zullo

Several new constructions of 3-dimensional optical orthogonal codes are presented here. In each case the codes have ideal autocorrelation $\mathbf{ \lambda_a=0} $, and in all but one case a cross correlation of $ \mathbf{\lambda_c=1} $. All…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson

Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…

Information Theory · Computer Science 2024-11-12 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang

In this paper, we present an iterative construction of a polar code and develop properties of the dual of a polar code. Based on this approach, belief propagation of a polar code can be presented in the context of low-density parity check…

Information Theory · Computer Science 2013-12-03 Marc Fossorier

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Information Theory · Computer Science 2017-04-14 Lin Sok , Minjia Shi , Patrick Solé

In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric designs. Further, we study orbit matrices of quasi-symmetric designs and give a construction of doubly even self-orthogonal codes from orbit…

Combinatorics · Mathematics 2023-08-03 Dean Crnković , Doris Dumičić Danilović , Ana Šumberac , Andrea Švob

In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and binary compressed sensing matrices. We also introduce deterministic bipolar $m\times n$ RIP fulfilling $\pm 1$ matrices of order $k$ such that…

Information Theory · Computer Science 2015-03-13 Arash Amini , Farokh Marvasti

A linear code is said to be self-orthogonal if it is contained in its dual. Self-orthogonal codes are of interest because of their important applications, such as for constructing linear complementary dual (LCD) codes and quantum codes. In…

Information Theory · Computer Science 2023-12-08 Dengcheng Xie , Shixin Zhu , Yang Li
‹ Prev 1 2 3 10 Next ›