Minimum average cost testing for partially ordered components

DOI10.1109/18.370098zbMath0823.94009OpenAlexW2157642372MaRDI QIDQ4840895

Marc J. Lipman, Julia Abrahams

Publication date: 6 November 1995

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

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

zbMATH Keywords

partial ordersvariable-length source codesalphabetic coding problembinary testsfaulty component

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Theory of error-correcting codes and error-detecting codes (94B99) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (7)

Searching in random partially ordered sets ⋮ An approximation algorithm for binary searching in trees ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Edge ranking and searching in partial orders ⋮ The binary identification problem for weighted trees ⋮ A strategy for searching with different access costs.

This page was built for publication: Minimum average cost testing for partially ordered components