Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2741420
Jump to:navigation, search

zbMath0988.94528MaRDI QIDQ2741420

Tero Laihonen, Sanna Ranto, Iiro S. Honkala

Publication date: 14 October 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsstrongly identifying codes


Mathematics Subject Classification ID

Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)


Related Items (2)

Optimal codes for strong identification ⋮ Families of optimal codes for strong identification




Cites Work

  • Unnamed Item
  • Unnamed Item
  • On strongly identifying codes
  • On the structure of linear codes with covering radius two and three
  • On a new class of codes for identifying vertices in graphs
  • Two families of optimal identifying codes in binary Hamming spaces
  • On codes identifying sets of vertices in Hamming spaces




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2741420&oldid=15606196"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 14:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki