Near-optimal covering sequences

DOI10.1007/S10623-026-01934-7MaRDI QIDQ7363326zbMATH OpenFDO

Authors Van Khu Vu

Publication date 29 September 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-026-01934-7

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites work

• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Constructions of covering sequences and 2D-sequences
• Covering codes with improved density
• Covering radius---Survey and recent results
• Cryptographically Strong de Bruijn Sequences with Large Periods
• De Bruijn covering codes with arbitrary alphabets
• De Bruijn Sequences and Perfect Factors
• Efficient Composited de Bruijn Sequence Generators
• Further results on the covering radius of codes
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• On the covering radius of codes
• Sequences and the de Bruijn graph. Properties, constructions, and applications
• Shift Register Sequences

This page was built for publication: Near-optimal covering sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363326)