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

A new type of coding problem

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

DOI10.1556/SScMath.38.2001.1-4.9zbMath1008.94027MaRDI QIDQ3150909

Graham R. Brightwell

Publication date: 20 October 2002

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)


zbMATH Keywords

graphdesigndistanceHamiltonian cyclecode


Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial aspects of packing and covering (05B40)


Related Items (4)

New type of coding problem motivated by database theory ⋮ Applications of graph containers in the Boolean lattice ⋮ Optimal Codes in the Enomoto-Katona Space ⋮ Coding Theory Motivated by Relational Databases






This page was built for publication: A new type of coding problem

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