A class of binary recurrent codes with limited error propagation

DOI10.1109/TIT.1967.1053951MaRDI QIDQ5531450zbMATH OpenWikidataFDO

Authors J. Paul Robinson, Arthur Bernstein

Publication date 1967

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1967.1053951

zbMATH Keywords

numerical analysis

Cited in

(15)

• Local search-based hybrid algorithms for finding Golomb rulers
• A tabu search algorithm for difference triangle sets and Golomb rulers
• Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
• Construction of LDPC convolutional codes via difference triangle sets
• The complexity of minimum difference cover
• Homometric sets in trees
• On the complexity of constructing Golomb rulers
• Problems on Two-Dimensional Synchronization Patterns
• Lower bounds on multiple difference sets
• New difference triangle sets by a field-programmable gate array-based search technique
• Partial reformulation-linearization based optimization models for the Golomb ruler problem
• Application of bat-inspired computing algorithm and its variants in search of near-optimal Golomb rulers for WDM systems: a comparative study
• GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
• Diffuse difference triangle sets
• Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison

This page was built for publication: A class of binary recurrent codes with limited error propagation

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