A class of binary recurrent codes with limited error propagation
From MaRDI portal
Publication:5531450
DOI10.1109/TIT.1967.1053951zbMath0152.15408WikidataQ56083333 ScholiaQ56083333MaRDI QIDQ5531450
J. Paul Robinson, Arthur Bernstein
Publication date: 1967
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (13)
Local search-based hybrid algorithms for finding Golomb rulers ⋮ Problems on Two-Dimensional Synchronization Patterns ⋮ GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA ⋮ The complexity of minimum difference cover ⋮ Construction of LDPC convolutional codes via difference triangle sets ⋮ Lower bounds on multiple difference sets ⋮ Application of Bat-Inspired Computing Algorithm and Its Variants in Search of Near-Optimal Golomb Rulers for WDM Systems: A Comparative Study ⋮ Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison ⋮ Diffuse difference triangle sets ⋮ Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design ⋮ Homometric sets in trees ⋮ On the complexity of constructing Golomb rulers ⋮ A tabu search algorithm for difference triangle sets and Golomb rulers
This page was built for publication: A class of binary recurrent codes with limited error propagation
