{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:00:11Z","timestamp":1648548011736},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p> Let [Formula: see text] denote the average Hamming distance of a binary constant weight code C. A<jats:sub>i<\/jats:sub> is the distance distribution of C and B<jats:sub>j<\/jats:sub> is the transform quantity of A<jats:sub>i<\/jats:sub>. Let \u03b2(n, M, w) denote the minimum average Hamming distance of a binary constant weight code with length n, size M, and weight w. In this paper, we have established the relation among B<jats:sub>j<\/jats:sub>, [Formula: see text] and A<jats:sub>i<\/jats:sub>. We also study the problem of determining \u03b2(n, M, w) and bounds of \u03b2(n, M, w) for different values of M. <\/jats:p>","DOI":"10.1142\/s1793830910000723","type":"journal-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T08:44:00Z","timestamp":1286873040000},"page":"379-388","source":"Crossref","is-referenced-by-count":0,"title":["AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES"],"prefix":"10.1142","volume":"02","author":[{"given":"MANJUSRI","family":"BASU","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Kalyani, Kalyani-741235, India"}]},{"given":"BANDHU","family":"PRASAD","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Kalyani, Kalyani-741235, India"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1042"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90017-6"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90048-5"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90024-R"},{"key":"rf5","volume":"10","author":"Delsarte P.","journal-title":"Philips Res. Rep. Suppl."},{"key":"rf6","first-page":"325","volume":"16","author":"Fu F.-W.","journal-title":"J. Math. Res. Expo."},{"key":"rf7","first-page":"803","volume":"45","author":"Fu F.-W.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02025880"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00284-5"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199804)27:4<223::AID-JGT3>3.0.CO;2-P"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00242-4"},{"key":"rf13","first-page":"269","volume":"89","author":"Xia S.-T.","journal-title":"Discrete Appl. Math."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.081"},{"key":"rf15","doi-asserted-by":"crossref","first-page":"3364","DOI":"10.1109\/TIT.2005.853313","volume":"51","author":"Xia S.-T.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(00)00271-8"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:34:47Z","timestamp":1565141687000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":15,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.1142\/S1793830910000723"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000723","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}