Several classes of (2ᵐ-1,w,2) optical orthogonal codes

DOI10.1016/S0166-218X(02)00439-0MaRDI QIDQ1811097zbMATH OpenOpenAlexFDO

Authors Cunsheng Ding, Chaoping Xing

Publication date 10 June 2003

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(02)00439-0

zbMATH Keywords

cyclic codescode-division multiple accessconstant-weight codesoptical orthogonal codesautocorrelation sequencescrosscorrelation sequencescollision channel without feedback

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Communication theory (94A05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Recommendations

• \((2^m-1,w,2)\) optical orthogonal codes with \(w=11\) and \(13\)
• Optical orthogonal codes-new bounds and an optimal construction
• Optical orthogonal codes: Their bounds and new optimal constructions
• Combinatorial constructions of optimal optical orthogonal codes with weight 4
• scientific article; zbMATH DE number 653250

Cites work

• scientific article; zbMATH DE number 4095378 (Why is no real title available?)
• scientific article; zbMATH DE number 1196713 (Why is no real title available?)
• A class of balanced binary sequences with optimal autocorrelation properties
• A new table of constant weight codes
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Maximum disjoint bases and constant-weight codes
• New constant weight codes from linear permutation groups
• New constructions of optimal cyclically permutable constant weight codes
• On the constructions of constant-weight codes
• Optical orthogonal codes-new bounds and an optimal construction
• Optical orthogonal codes: design, analysis and applications
• Some combinatorial constructions for optical orthogonal codes

Cited in

(8)

• A lower bound on the 2-adic complexity of the modified Jacobi sequence
• Spectral Classification and Multiplicative Partitioning of Constant-Weight Sequences Based on Circulant Matrix Representation of Optical Orthogonal Codes
• \((2^m-1,w,2)\) optical orthogonal codes with \(w=11\) and \(13\)
• A class of three-weight and five-weight linear codes
• On two applications of polynomials \(x^k-cx-d\) over finite fields and more
• Semi-cyclic holey group divisible designs and applications to sampling designs and optical orthogonal codes
• Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes
• Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes

This page was built for publication: Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811097)