{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:49:57Z","timestamp":1776782997134,"version":"3.51.2"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0166-218x(91)90106-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"25-41","source":"Crossref","is-referenced-by-count":21,"title":["Efficient q-ary immutable codes"],"prefix":"10.1016","volume":"33","author":[{"given":"Renato M.","family":"Capocelli","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90106-7_bib1","article-title":"On Balanced Codes","author":"Al-Bassan","year":"1988","journal-title":"IEEE International Symposium Information Theory"},{"key":"10.1016\/0166-218X(91)90106-7_bib2","series-title":"The Theory of Partitions","author":"Andrews","year":"1976"},{"key":"10.1016\/0166-218X(91)90106-7_bib3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0019-9958(61)80037-5","article-title":"A note on error detecting codes for asymmetric channel","volume":"4","author":"Berger","year":"1961","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(91)90106-7_bib4","series-title":"Combinatorics","author":"Bollobas","year":"1986"},{"key":"10.1016\/0166-218X(91)90106-7_bib5","first-page":"102","article-title":"On unordered codes","author":"Bose","year":"1987","journal-title":"Proceedings 17th International Symposium on Fault-Tolerant Computing"},{"key":"10.1016\/0166-218X(91)90106-7_bib6","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/TC.1982.1676043","article-title":"Optimal unidirectional error detecting\/correcting codes","volume":"31","author":"Bose","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(91)90106-7_bib7","doi-asserted-by":"crossref","unstructured":"R.M. Capocelli, L. Gargano and U. Vaccaro, An efficient algorithm to test immutability of variable length codes, IEEE Trans. Inform. Theory, to appear.","DOI":"10.1109\/18.45290"},{"key":"10.1016\/0166-218X(91)90106-7_bib8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/T-C.1973.223704","article-title":"Design of self-checking microprogram control","volume":"22","author":"Cook","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(91)90106-7_bib9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"key":"10.1016\/0166-218X(91)90106-7_bib10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/S0019-9958(62)90223-1","article-title":"Optimal error detecting codes for completely asymmetric binary channels","volume":"5","author":"Freiman","year":"1962","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(91)90106-7_bib11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0097-3165(74)90027-2","article-title":"The morphology of partially ordered sets","volume":"17","author":"Harper","year":"1974","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(91)90106-7_bib12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/sapm1973523285","article-title":"Normalized matching in direct product of partially ordered sets","volume":"52","author":"Hsieh","year":"1973","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/0166-218X(91)90106-7_bib13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.1986.1057136","article-title":"Efficient balanced codes","volume":"32","author":"Knuth","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90106-7_bib14","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TC.1984.1676498","article-title":"Data integrity on digital optical discs","volume":"33","author":"Leiss","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(91)90106-7_bib15","first-page":"91","article-title":"On codes which are unchangeable under given subversions","volume":"10","author":"Leiss","year":"1985","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0166-218X(91)90106-7_bib16","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/TIT.1987.1057369","article-title":"On testing for immutability of codes","volume":"33","author":"Leiss","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(91)90106-7_bib17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(82)90344-8","article-title":"How to re-use a \u2018write-once\u2019 memory","volume":"55","author":"Rivest","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(91)90106-7_bib18","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","article-title":"Ein Satz\u00fcber Untermengen einer endlichen Menge","volume":"27","author":"Sperner","year":"1928","journal-title":"Math. Z."},{"key":"10.1016\/0166-218X(91)90106-7_bib19","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BF01836532","article-title":"An asymptotic formula in the theory of compositions","volume":"13","author":"Star","year":"1975","journal-title":"Aequationes Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91901067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91901067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:51:00Z","timestamp":1555116660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X91901067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0166218X91901067"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90106-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}