Arrays composed from the extended rational cycle
From MaRDI portal
Publication:2397495
DOI10.3934/amc.2017024zbMath1404.94151OpenAlexW2612069253MaRDI QIDQ2397495
Domingo Gómez-Pérez, Andrew Tirkel, Ana I. Gómez
Publication date: 22 May 2017
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2017024
Groebner basislinear complexityChinese remainder theoremwatermarkmultidimensional arrayrecursion polynomial
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
Related Items
Analysis and computation of multidimensional linear complexity of periodic arrays, New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems, Recursion polynomials of unfolded sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- On the correlation of pseudorandom numbers generated by inversive methods
- A new family of frequency-hop codes
- Finding a Gröbner basis for the ideal of recurrence relations on m-dimensional periodic arrays
- New Optimal Low Correlation Sequences for Wireless Communications
- A Construction for Perfect Periodic Autocorrelation Sequences
- Families of 3D Arrays for Video Watermarking
- New families of binary sequences with low correlation
- Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)
- Shift-register synthesis and BCH decoding
- Decomposition of M-sequences and its applications