{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T11:51:34Z","timestamp":1711972294305},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,26]],"date-time":"2013-07-26T00:00:00Z","timestamp":1374796800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10623-013-9867-7","type":"journal-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T12:30:05Z","timestamp":1374755405000},"page":"379-394","source":"Crossref","is-referenced-by-count":9,"title":["Optimum commutative group codes"],"prefix":"10.1007","volume":"74","author":[{"given":"Cristiano","family":"Torezzan","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o E.","family":"Strapasson","sequence":"additional","affiliation":[]},{"given":"Sueli I. R.","family":"Costa","sequence":"additional","affiliation":[]},{"given":"Rogerio M.","family":"Siqueira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,26]]},"reference":[{"key":"9867_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1d\u00e1m A.: Research problem 2\u201310. J. Comb. Theory. 2, 393 (1967).","DOI":"10.1016\/S0021-9800(67)80037-1"},{"key":"9867_CR2","unstructured":"Banihashemi A.H., Blake I.F.: Trellis complexity and minimal trellis of lattices. IEEE Trans. Inf. Theory 44(5), 1829\u20131847 (1998)."},{"key":"9867_CR3","unstructured":"Banihashemi A.H., Blake I.F.: On the trellis complexity of root lattices and their duals. IEEE Trans. Inf. Theory 45, 2168\u201321726 (1999)."},{"key":"9867_CR4","unstructured":"Benedetto S., Garello R., Mondin M., Montorsi G.: Geometrically uniform partitions of $$L \\times MPSK$$ L \u00d7 M P S K constellations and related binary trellis codes. IEEE Trans. Inf. Theory 39, 1773\u20131798 (1993)."},{"key":"9867_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein D., Buchmann J., Dahmen E.: Post-quantum Cryptography. Springer, Berlin (2009).","DOI":"10.1007\/978-3-540-88702-7"},{"key":"9867_CR6","unstructured":"Biglieri E., Elia M.: Cyclic-group codes for the Gaussian channel. IEEE Trans. Inf. Theory 22, 624\u2013629 (1976)."},{"key":"9867_CR7","unstructured":"Blake I.F., Tarokh V.: On the Trellis complexity of the densest lattice packings in $${\\mathbb{R}}^n $$ R n . SIAM J. Discret. Math. 9(4), 597\u2013601 (1996)."},{"key":"9867_CR8","doi-asserted-by":"crossref","unstructured":"Buchmann J., Lindner R., R\u00fcckert M., Schneider M.: Explicit hard instances of the shortest vector problem. Cryptology ePrint Archive Report 333 (2008).","DOI":"10.1007\/978-3-540-88403-3_6"},{"key":"9867_CR9","unstructured":"Caire G., Biglieri E.: Linear block codes over cyclic groups. IEEE Trans. Inf. Theory 41, 1246\u20131256 (1995)"},{"key":"9867_CR10","unstructured":"Cohen H.: A Course in Computational Algebraic Number Theory. Springer, New York (1996)."},{"key":"9867_CR11","unstructured":"Como G., Fagnani F.: Average spectra and minimum distances of low density parity check codes over cyclic groups. SIAM J. Discret. Math. 23, 19\u201353 (2008)."},{"key":"9867_CR12","unstructured":"Como G., Fagnani F.: The capacity of Abelian group codes over symmetric channels. IEEE Trans. Inf. Theory 55, 2037\u20132054 (2009)."},{"key":"9867_CR13","doi-asserted-by":"crossref","unstructured":"Costa S.I.R., Strapasson J.E., Alves M.M.S., Carlos T.B.: Circulant graphs and tessellations on flat tori. Linear Algebra Appl. 432(1), 369\u2013382 (2010).","DOI":"10.1016\/j.laa.2009.08.040"},{"key":"9867_CR14","unstructured":"Erez U., Miller G.: The ML decoding performance of LDPC ensembles over Zq. IEEE Trans. Inf. Theory 51, 1871\u20131879 (2005)."},{"key":"9867_CR15","unstructured":"Ericson Th., Zinoviev V.: Codes on Euclidean Spheres. Elsevier, North-Holland (2001)."},{"key":"9867_CR16","unstructured":"Fagnani F., Zampieri S.: Minimal syndrome formers for group codes. IEEE Trans. Inf. Theory 45, 1\u201331 (1998)."},{"key":"9867_CR17","doi-asserted-by":"crossref","unstructured":"Fagnani F., Zampieri S.: Minimal and systematic convolutional codes over finite Abelian groups. Linear Algebra Appl. 378, 31\u201359 (2004).","DOI":"10.1016\/j.laa.2003.09.001"},{"key":"9867_CR18","unstructured":"Forney G.D.: Geometrically uniform codes. IEEE Trans. Inf. Theory 37(6), 1241\u20131259 (1991)"},{"key":"9867_CR19","unstructured":"Forney Jr G.D., Trott M.D.: The dynamics of group codes: state spaces, trellis diagrams and canonical encoders. IEEE Trans. Inf. Theory 39, 1491\u20131513 (1993)."},{"key":"9867_CR20","doi-asserted-by":"crossref","unstructured":"Forney G.D., Jr. Trott M.D.: The dynamics of group codes: Dual abelian group codes and systems, IEEE Trans. Inf. Theory 50(12), 2935\u20132965 (2004). doi: 10.1109\/TIT.2004.838340 .","DOI":"10.1109\/TIT.2004.838340"},{"key":"9867_CR21","unstructured":"Gantmacher F.R.: The Theory of Matrices, vol. 1. Chelsea, New York (1959)."},{"key":"9867_CR22","unstructured":"Garello R., Montorsi G., Benedetto S., Divsalar D., Pollara F.: Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes. IEEE Trans. Inf. Theory 48, 123\u2013136 (2002)"},{"key":"9867_CR23","unstructured":"Garin F., Fagnani F.: Analysis of serial turbo codes over Abelian groups for geometrically uniform constellations. SIAM J. Discret. Math. 22, 1488\u20131526 (2008)."},{"key":"9867_CR24","unstructured":"Ingemarsson I.: Group Codes for the Gaussian Channel. Lecture Notes in Control and Information Sciences, vol. 128, pp. 73\u2013108. Springer, Berlin (1989)."},{"key":"9867_CR25","unstructured":"Loeliger H.: Signals sets matched to groups. IEEE Trans. Inf. Theory 37, 1675\u20131682 (1991)."},{"key":"9867_CR26","doi-asserted-by":"crossref","unstructured":"Micciancio D., Goldwasser S.: Complexity of Lattice Problems: A Cryptographic Perspective, vol. 671. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic, Boston (2002).","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"9867_CR27","doi-asserted-by":"crossref","unstructured":"Mittelholzer T., Lahtonen J.: Group codes generated by finite reflection groups. IEEE Trans. Inf. Theory IT\u201342(1), 519\u2013528 (1996).","DOI":"10.1109\/18.485721"},{"key":"9867_CR28","unstructured":"Neelamani R., Dash S., Baraniuk R.G.: On nearly orthogonal lattice bases and random lattices. SIAM J. Discret. Math. 21(1), 199\u2013219 (2007)."},{"key":"9867_CR29","doi-asserted-by":"crossref","unstructured":"Siqueira R.M., Costa S.R.I.: Flat tori, lattices and bounds for commutative group codes. Des. Codes Cryptogr. 49, 307\u2013312 (2008).","DOI":"10.1007\/s10623-008-9183-9"},{"key":"9867_CR30","doi-asserted-by":"crossref","unstructured":"Slepian D.: Group codes for the Gaussian channel. Bell Syst. Tech. J. 47, 575\u2013602 (1968)","DOI":"10.1002\/j.1538-7305.1968.tb02486.x"},{"key":"9867_CR31","unstructured":"Slepian D.: On neighbor distances and symmetry in group code. IEEE Trans. Inf. Theory 17, 630\u2013632 (1971)."},{"key":"9867_CR32","unstructured":"Sridhara D., Fuja T.E.: LDPC codes over rings for PSK modulation. IEEE Trans. Inf. Theory 51(9), 3209\u20133220 (2005)."},{"key":"9867_CR33","unstructured":"Torezzan C., Costa S.I.R., Vaishampayan V.A.: Spherical codes on torus layers. In: IEEE International Symposium on Information Theory, Seoul, Korea (2009)."},{"key":"9867_CR34","unstructured":"Viterbi A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory 13, 260\u2013269 (1967)."},{"key":"9867_CR35","unstructured":"Zamir R.: Lattices are Everywhere, pp. 392\u2013421. Information Theory and Applications, Workshop, San Diego (2009)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9867-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9867-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9867-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T08:43:36Z","timestamp":1563525816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9867-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,26]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9867"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9867-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,26]]}}}