Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The complexity of computing the covering radius of a code - MaRDI portal

The complexity of computing the covering radius of a code

From MaRDI portal

Publication:3222113

Jump to:navigation, search

DOI10.1109/TIT.1984.1056978zbMath0556.94009MaRDI QIDQ3222113

Aileen M. McLoughlin

Publication date: 1984

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

zbMATH Keywords

covering radius NP-hard binary linear code polynomial hierarchy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05)

Related Items (6)

Factorization properties of lattices over the integers ⋮ On covering problems of codes ⋮ On identifying codes in binary Hamming spaces ⋮ Computational complexity characterization of protecting elections from bribery ⋮ Locating-Domination and Identification ⋮ Ensuring Message Embedding in Wet Paper Steganography

This page was built for publication: The complexity of computing the covering radius of a code

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3222113&oldid=16377144"