On binary linear codes and binary pseudo-random sequences
From MaRDI portal
Publication:6580196
DOI10.1142/s0219498825500677zbMATH Open1546.94124MaRDI QIDQ6580196
Verónica Requena, Joan-Josep Climent, Sara D. Cardell
Publication date: 29 July 2024
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modified self-shrinking generator
- Linear complexity of generalized sequences by comparison of PN-sequences
- On MDS codes via Cauchy matrices
- Generalized Self-Shrinking Generator
- On cosets of the generalized first-order reed-muller code with low PMEPR
- On generator matrices of MDS codes (Corresp.)
- Foundations of Cryptography
- Fundamentals of Error-Correcting Codes
- Error Detecting and Error Correcting Codes
- On lowest density MDS codes
- New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes
- Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Decimation of Periodic Sequences
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
This page was built for publication: On binary linear codes and binary pseudo-random sequences