Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. Karpinski, M. & Nekrich, Y. Parallel Process. Lett., 16(1):81-92, 2006. Link Paper bibtex @article{journals/ppl/KarpinskiN06,
added-at = {2020-03-24T00:00:00.000+0100},
author = {Karpinski, Marek and Nekrich, Yakov},
biburl = {https://www.bibsonomy.org/bibtex/25b7aba8980ca71b6fc7835e960310063/dblp},
ee = {https://doi.org/10.1142/S0129626406002484},
interhash = {445ebbb5873370503573145bde154c4c},
intrahash = {5b7aba8980ca71b6fc7835e960310063},
journal = {Parallel Process. Lett.},
keywords = {dblp},
number = 1,
pages = {81-92},
timestamp = {2020-03-25T11:39:36.000+0100},
title = {Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.},
url = {http://dblp.uni-trier.de/db/journals/ppl/ppl16.html#KarpinskiN06},
volume = 16,
year = 2006
}
Downloads: 0
{"_id":"MvbLYYRME6fu6E8YD","bibbaseid":"karpinski-nekrich-algorithmsforconstructionofoptimalandalmostoptimallengthrestrictedcodes-2006","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Karpinski, M.","Nekrich, Y."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-03-24T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Karpinski"],"firstnames":["Marek"],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/25b7aba8980ca71b6fc7835e960310063/dblp","ee":"https://doi.org/10.1142/S0129626406002484","interhash":"445ebbb5873370503573145bde154c4c","intrahash":"5b7aba8980ca71b6fc7835e960310063","journal":"Parallel Process. Lett.","keywords":"dblp","number":"1","pages":"81-92","timestamp":"2020-03-25T11:39:36.000+0100","title":"Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.","url":"http://dblp.uni-trier.de/db/journals/ppl/ppl16.html#KarpinskiN06","volume":"16","year":"2006","bibtex":"@article{journals/ppl/KarpinskiN06,\n added-at = {2020-03-24T00:00:00.000+0100},\n author = {Karpinski, Marek and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/25b7aba8980ca71b6fc7835e960310063/dblp},\n ee = {https://doi.org/10.1142/S0129626406002484},\n interhash = {445ebbb5873370503573145bde154c4c},\n intrahash = {5b7aba8980ca71b6fc7835e960310063},\n journal = {Parallel Process. Lett.},\n keywords = {dblp},\n number = 1,\n pages = {81-92},\n timestamp = {2020-03-25T11:39:36.000+0100},\n title = {Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.},\n url = {http://dblp.uni-trier.de/db/journals/ppl/ppl16.html#KarpinskiN06},\n volume = 16,\n year = 2006\n}\n\n","author_short":["Karpinski, M.","Nekrich, Y."],"key":"journals/ppl/KarpinskiN06","id":"journals/ppl/KarpinskiN06","bibbaseid":"karpinski-nekrich-algorithmsforconstructionofoptimalandalmostoptimallengthrestrictedcodes-2006","role":"author","urls":{"Link":"https://doi.org/10.1142/S0129626406002484","Paper":"http://dblp.uni-trier.de/db/journals/ppl/ppl16.html#KarpinskiN06"},"keyword":["dblp"],"metadata":{"authorlinks":{"nekrich, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.bibsonomy.org%2Fbib%2Fauthor%2Fyakov%20nekrich%3Fitems=1000&msg=embed"}},"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:00.654Z","downloads":0,"keywords":["dblp"],"search_terms":["algorithms","construction","optimal","optimal","length","restricted","codes","karpinski","nekrich"],"title":"Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.","year":2006,"dataSources":["f7XsgZohqQ3Rphbct"]}