Constructions of cyclic quaternary constant-weight codes of weight three and distance four
From MaRDI portal
Publication:1744017
DOI10.1007/s10623-017-0379-8zbMath1384.94132OpenAlexW2727227164MaRDI QIDQ1744017
Liantao Lan, Li-Dong Wang, Yan Xun Chang
Publication date: 16 April 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0379-8
Related Items (2)
The completion of optimal cyclic quaternary codes of weight 3 and distance 3 ⋮ Strong Skolem starters
Cites Work
- Two classes of optimal two-dimensional OOCs
- Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs
- Langford sequences: Perfect and hooked
- Further results on optimal optical orthogonal codes with weight 4.
- A general construction for optimal cyclic packing designs
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions
- Optimal (4up, 5, 1) optical orthogonal codes
- On certain distributions of integers in pairs with given differences
- Verification of a Conjecture of Th. Skolem.
- Optical orthogonal codes: design, analysis and applications
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Extended skolem sequences
- Fundamentals of Error-Correcting Codes
- Constructions for optimal (υ, 4, 1) optical orthogonal codes
- On partitions of {1,…,2m + 1}\{k} into differences d,…,d + m − 1: Extended Langford sequences of large defect
- Combinatorial constructions of optimal optical orthogonal codes with weight 4
- Disjoint skolem sequences and related disjoint structures
- On the minimum distance of cyclic codes
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Cyclic Codes From the Two-Prime Sequences
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On decoding BCH codes
- On Langford’s Problem (II)
- Cyclically permutable error-correcting codes
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
This page was built for publication: Constructions of cyclic quaternary constant-weight codes of weight three and distance four
