Two binary sequence families with large merit factor
From MaRDI portal
asymptoticbinary sequenceconstructionLegendre sequencemerit factornegaperiodicperiodicrotationskew-symmetric
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Recommendations
- Advances in the merit factor problem for binary sequences
- scientific article; zbMATH DE number 1390146
- Binary Sequences With Merit Factor<tex>$≫ 6.3$</tex>
- The merit factor of binary sequence families constructed from m-sequences
- Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>
Cited in
(10)- Advances in the merit factor problem for binary sequences
- The merit factor of binary sequence families constructed from m-sequences
- The merit factor of Legendre sequences (Corresp.)
- The merit factor of binary sequences related to difference sets
- Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>
- Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6
- Littlewood polynomials with small \(L^4\) norm
- Efficient Optimization of the Merit Factor of Long Binary Sequences
- A Survey of the Merit Factor Problem for Binary Sequences
- The merit factor of binary arrays derived from the quadratic character
This page was built for publication: Two binary sequence families with large merit factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268246)
