{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:38Z","timestamp":1725551918757},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314233"},{"type":"electronic","value":"9783540314240"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11617983_27","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T07:27:38Z","timestamp":1137050858000},"page":"275-284","source":"Crossref","is-referenced-by-count":0,"title":["New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels"],"prefix":"10.1007","author":[{"given":"Lan","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying Yu","family":"Tai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behshad","family":"Memari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bahram","family":"Honary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1111\/j.1469-1809.1939.tb02219.x","volume":"9","author":"R.C. Bose","year":"1939","unstructured":"Bose, R.C.: On the construction of balanced incomplete designs. Ann. Eugenics\u00a09, 353\u2013399 (1939)","journal-title":"Ann. Eugenics"},{"key":"27_CR2","volume-title":"Analysis and Design of Experiments","author":"H.B. Mann","year":"1949","unstructured":"Mann, H.B.: Analysis and Design of Experiments. Dover Publishers, New York (1949)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"IT-8","author":"R.G. Gallager","year":"1962","unstructured":"Gallager, R.G.: Low density parity-check codes. IRE Trans. Inform. Theory\u00a0IT-8, 21\u201328 (1962)","journal-title":"IRE Trans. Inform. Theory"},{"issue":"6","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1109\/TIT.2004.828144","volume":"50","author":"B. Ammar","year":"2004","unstructured":"Ammar, B., Honary, B., Kou, Y., Xu, J., Lin, S.: Construction of low density parity-check codes based on balanced imcomplete block designs. IEEE Trans. Inform. Theory\u00a050(6), 1257\u20131268 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R.M. Tanner","year":"1981","unstructured":"Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inform. Theory\u00a027, 533\u2013547 (1981)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D.J.C. MacKay","year":"1999","unstructured":"MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory\u00a045, 399\u2013432 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T. Richardson","year":"2001","unstructured":"Richardson, T., Urbanke, R.: The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory\u00a047, 599\u2013618 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"F.R. Kschinschang","year":"2001","unstructured":"Kschinschang, F.R., Frey, B.J., Loeliger, H.-A.: Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory\u00a047, 498\u2013519 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Li, Z.-W., Chen, L., Lin, S., Fong, W., Yeh, P.-S.: Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Trans. Commun (2005) (accepted)","DOI":"10.1109\/TCOMM.2005.858628"},{"issue":"7","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TCOMM.2004.831353","volume":"52","author":"L. Chen","year":"2004","unstructured":"Chen, L., Xu, J., Djurdjevic, I., Lin, S.: Near Shannon limit quasi-cyclic low-density parity-check codes. IEEE Trans. Commun.\u00a052(7), 1038\u20131042 (2004)","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/TIT.2004.828088","volume":"50","author":"H. Tang","year":"2004","unstructured":"Tang, H., Xu, J., Kou, Y., Lin, S., Abdel-Ghaffar, K.: On algebraic construction of Gallager and circulant low density parity-check codes. IEEE Trans. Inform. Theory\u00a050(6), 1269\u20131279 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR12","unstructured":"Chen, L., Djurdjevic, I., Xu, J., Lin, S., Abdel-Ghaffar, K.: Construction of QC-LDPC codes based on the minimum-weight codewords of RS codes. In: Proc. IEEE Int. Symp. Inform. Theory, Chicago, IL, June 27-July 2, p. 239 (2004)"},{"key":"27_CR13","unstructured":"Chen, L., Lan, L., Djurdjevic, I., Lin, S., Abdel-Ghaffar, K.: An algebraic method for constructing quasi-cyclic LDPC codes. In: Proc. Int. Symp. Inform. Theory and Its Applications, ISITA 2004, Parma, Italy, October 10-13, pp. 535\u2013539 (2004)"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TCOMM.2004.841966","volume":"53","author":"J. Xu","year":"2005","unstructured":"Xu, J., Chen, L., Zeng, L., Lan, L., Lin, S.: Construction of low-density parity-check codes by superposition. IEEE Trans. Commun.\u00a053(2), 243\u2013251 (2005)","journal-title":"IEEE Trans. Commun."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y. Kou","year":"2001","unstructured":"Kou, Y., Lin, S., Fossorier, M.: Low density parity-check codes based on finite geometries: a discovery and new results. IEEE Trans. Inform. Theory\u00a047, 2711\u20132736 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR16","volume-title":"Error Control Coding: Fundamentals and Applications","author":"S. Lin","year":"2004","unstructured":"Lin, S., Costello Jr., D.J.: Error Control Coding: Fundamentals and Applications, 2nd edn. Prentice Hall, Upper Saddle River (2004)","edition":"2"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Tanner, R.M.: Spectral graphs for quasi-cyclic LDPC codes. In: Proc. IEEE int. Symp. on Inform. Theory, Washington D.C., June 24-29, p. 226 (2001)","DOI":"10.1109\/ISIT.2001.936089"},{"issue":"6","key":"27_CR18","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C. Di","year":"2002","unstructured":"Di, C., Proietti, D., Teletar, I.E., Richarson, T.J., Urbanke, R.L.: Finite length analysis of low-density parity-check codes on binary erasure channel. IEEE Trans. Inform. Theory\u00a048(6), 1570\u20131579 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Orlitsky, A., Urbanke, R.L., Viswanathan, K., Zhang, J.: Stopping sets and the girth of Tanner graph. In: Proc. Int. Symp. Inform. Theory, Lausanne, Switzerland, June 30-July 5, p. 2 (2002)","DOI":"10.1109\/ISIT.2002.1023274"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1109\/LCOMM.2003.814716","volume":"7","author":"I. Djurdjevic","year":"2003","unstructured":"Djurdjevic, I., Xu, J., Abdel-Ghaffar, K., Lin, S.: Construction of low-density parity-check codes based on shortened Reed-Solomon codes with two information symbols. IEEE Commun. Lett.\u00a0(7), 317\u2013319 (July 2003)","journal-title":"IEEE Commun. Lett."},{"key":"27_CR21","unstructured":"Richardson, T.: Error floors of LDPC codes. In: Proc. Allerton Conf. on Communication, Control and computing, Monticello, IL, October 2003, pp. 1426\u20131435 (2003)"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11617983_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:11:53Z","timestamp":1619493113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11617983_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314233","9783540314240"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11617983_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}