Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
From MaRDI portal
Cites work
- A powerful method for constructing difference families and optimal optical orthogonal codes
- Classes of optical orthogonal codes from ARCS in root subspaces
- Coding for Errors and Erasures in Random Network Coding
- Construction of Sidon spaces with applications to coding
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with =2
- Constructions of Optical Orthogonal Codes from Finite Geometry
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Error-Correcting Codes in Projective Space
- Families of Optimal OOCs With $\lambda = 2$
- Further progress on difference families with block size 4 or 5
- Geometric constructions of optimal optical orthogonal codes
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- Large optimal cyclic subspace codes
- Linearized trinomials with maximum kernel
- Multi-orbit cyclic subspace codes and linear sets
- New constructions of optimal cyclically permutable constant weight codes
- New constructions of Sidon spaces and large cyclic constant dimension codes
- On two applications of polynomials \(x^k-cx-d\) over finite fields and more
- Optical orthogonal codes and arcs in \(\mathrm{PG}(d,q)\)
- Optical orthogonal codes from Singer groups
- Optical orthogonal codes obtained from conics on finite projective planes
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Optical orthogonal codes-new bounds and an optimal construction
- Optical orthogonal codes: design, analysis and applications
- Optimal \((n,4,2)\)-OOC of small orders.
- Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes
- Some progress on (v,4,1) difference families and optical orthogonal codes
- Some results on linearized trinomials that split completely
Cited in
(1)
This page was built for publication: Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950866)