{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1367593","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1367593","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1367593","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T21:49:05Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1367593","name":"Linear programming bounds for codes of small size","headline":"Linear programming bounds for codes of small size","description":"scientific article; zbMATH DE number 1066019","url":"https://portal.mardi4nfdi.de/entity/Q1367593","datePublished":"2002-04-21","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q188612"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1199594"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q166287"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1006/EUJC.1996.0129","url":"https://doi.org/10.1006/EUJC.1996.0129"},"sameAs":["https://doi.org/10.1006/EUJC.1996.0129"]},"provenance":{"prov:generatedAtTime":"2025-12-25T21:49:05Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}