Коды для $m$-метрики
М. Ю. Розенблюм, М. А. Цфасман

Эта публикация цитируется в следующих статьяx:

1. Н. А. Полянский, “О списочном декодировании некоторых $\mathbb{F}_q$-линейных кодов”, Пробл. передачи информ., 57:4 (2021), 45–62    ; N. A. Polyanskii, “On list decoding of certain $\mathbb{F}_q$-linear codes”, Problems Inform. Transmission, 57:4 (2021), 341–356    
2. Panek L., Panek Nayene Michele Paiao, “Optimal Anticodes, Diameter Perfect Codes, Chains and Weights”, IEEE Trans. Inf. Theory, 67:7 (2021), 4255–4262          
3. Raviv N., Schwartz M., Cohen R., Cassuto Yu., “Hierarchical Erasure Correction of Linear Codes”, Finite Fields their Appl., 68 (2020), 101743          
4. Panek L., Pinheiro J.A., “General Approach to Poset and Additive Metrics”, IEEE Trans. Inf. Theory, 66:11 (2020), 6823–6834          
5. Goda T., “Richardson Extrapolation Allows Truncation of Higher-Order Digital Nets and Sequences”, IMA J. Numer. Anal., 40:3 (2020), 2052–2075          
6. Santos W., Alves M.M., “Polynomial Invariant Theory and Shape Enumerator of Self-Dual Codes in the Nrt-Metric”, IEEE Trans. Inf. Theory, 66:7 (2020), 4061–4074          
7. Dass B.K., Sharma N., Verma R., “Mds and i-Perfect Poset Block Codes”, Finite Fields their Appl., 62 (2020), 101620          
8. Dinh H.Q. Nguyen B.T. Yamaka W., “Constacyclic Codes of Length 3P(S) Over F-Pm + Uf(Pm) and Their Application in Various Distance Distributions”, IEEE Access, 8 (2020), 204031–204056        
9. Sidana T., Sharma A., “Repeated-Root Constacyclic Codes Over the Chain Ring F-P(M) [U]/< U(3)>”, IEEE Access, 8 (2020), 101320–101337        
10. Bulut Yilgor M., Demirkale F., “on Perfect Codes in the Lee-Rosenbloom-Tsfasman-Jain Metric”, Sigma J. Eng. Nat. Sci., 37:4 (2019), 1321–1329  
11. Hyun J.Y., Kim H.K., Park J.R., “Weighted Posets and Digraphs Admitting the Extended Hamming Code to Be a Perfect Code”, IEEE Trans. Inf. Theory, 65:8 (2019), 4664–4672          
12. Panario D., Saaltink M., Stevens B., Wevrick D., “a General Construction of Ordered Orthogonal Arrays Using Lfsrs”, IEEE Trans. Inf. Theory, 65:7 (2019), 4316–4326          
13. Castoldi A.G., do Monte Carmelo E.L., da Silva R., “Partial Sums of Binomials, Intersecting Numbers, and the Excess Bound in Rosenbloom-Tsfasman Space”, Comput. Appl. Math., 38:2 (2019), UNSP 55        
14. Sharma A., Sidana T., “on the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings”, IEEE Trans. Inf. Theory, 65:2 (2019), 1072–1084          
15. Ramamoorthy A., Tang L., Vontobel P.O., “Universally Decodable Matrices For Distributed Matrix-Vector Multiplication”, 2019 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2019, 1777–1781  
16. Raviv N., Yu Q., Bruck J., Avestimehr S., “Download and Access Trade-Offs in Lagrange Coded Computing”, 2019 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2019, 1787–1791  
17. Castoldi A.G., do Monte Carmelo E.L., Moura L., Panario D., Stevens B., “Bounds on Covering Codes in Rt Spaces Using Ordered Covering Arrays”, Algebraic Informatics, Cai 2019, Lecture Notes in Computer Science, 11545, eds. Ciric M., Droste M., Pin J., Springer International Publishing Ag, 2019, 100–111          
18. Dinh H.Q., Bac Trong Nguyen, Sriboonchitta S., “Rt Distance and Weight Distributions of Type 1 Constacyclic Codes of Length 4P(S) Over F(P)M[U]/< U(a)>”, Turk. J. Math., 43:2 (2019), 561–578          
19. Klin-Eam Ch., Sriwirach W., “Repeated-Root Constacyclic Codes of Length 2P(S) Over Galois Rings”, Bull. Korean. Math. Soc., 56:1 (2019), 131–150          
20. Dass B.K., Sharma N., Verma R., “Characterization of Extended Hamming and Golay Codes as Perfect Codes in Poset Block Spaces”, Adv. Math. Commun., 12:4 (2018), 629–639          
21. Etzion T., Firer M., Machado R.A., “Metrics Based on Finite Directed Graphs and Coding Invariants”, IEEE Trans. Inf. Theory, 64:4, 1 (2018), 2398–2409          
22. Goda T., Suzuki K., Yoshiki T., “Optimal Order Quadrature Error Bounds For Infinite-Dimensional Higher-Order Digital Sequences”, Found. Comput. Math., 18:2 (2018), 433–458          
23. Gluesing-Luerssen H., Pllaha T., “Extension Theorems For Various Weight Functions Over Frobenius Bimodules”, J. Algebra. Appl., 17:3 (2018), 1850052          
24. Kopparty S., Ron-Zewi N., Saraf Sh., Wootters M., “Improved Decoding of Folded Reed-Solomon and Multiplicity Codes”, 2018 IEEE 59Th Annual Symposium on Foundations of Computer Science (Focs), Annual IEEE Symposium on Foundations of Computer Science, ed. Thorup M., IEEE Computer Soc, 2018, 212–223        
25. Dinh H.Q., Bac Trong Nguyen, Sriboonchitta S., “On a Class of Constacyclic Codes of Length 2P(S) Over F(P)M[U]/<U(a)>”, Bull. Korean. Math. Soc., 55:4 (2018), 1189–1208          
26. Shi M., Tang J., Ge M., “Macwilliams Identities of Linear Codes With Respect to Rt Metric Over Mnxs(F-2[U, V]/< U(K), V(2), Uv - Vu >)”, IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E100A:11 (2017), 2522–2527      
27. Dick J., Goda T., Suzuki K., Yoshiki T., “Construction of Interlaced Polynomial Lattice Rules For Infinitely Differentiable Functions”, Numer. Math., 137:2 (2017), 257–288          
28. Goda T., Suzuki K., Yoshiki T., “Quasi-Monte Carlo Integration For Twice Differentiable Functions Over a Triangle”, J. Math. Anal. Appl., 454:1 (2017), 361–384          
29. Dass B.K., Sharma N., Verma R., “Perfect Codes in Poset Spaces and Poset Block Spaces”, Finite Fields their Appl., 46 (2017), 90–106          
30. Castoldi A.G., Moura L., Panario D., Stevens B., “Ordered Orthogonal Array Construction Using Lfsr Sequences”, IEEE Trans. Inf. Theory, 63:2 (2017), 1336–1347          
31. Krisnawati V.H., Nisa Anzi Lina Ukhtin, “Construction of Self-Dual Codes in the Rosenbloom-Tsfasman Metric”, AIP Conference Proceedings, 1913, eds. Kilicman A., Wibowo R., Marjono, Imron M., Amer Inst Physics, 2017, UNSP 020016      
32. Goda T., Suzuki K., Yoshiki T., “Optimal Order Quasi-Monte Carlo Integration in Weighted Sobolev Spaces of Arbitrary Smoothness”, IMA J. Numer. Anal., 37:1 (2017), 505–518          
33. Marka V., Selvaraj R.S., Gnanasudha I., “Self-Dual Codes in the Rosenbloom-Tsfasman Metric”, Math. Commun., 22:1 (2017), 75–87      
34. Dinh H.Q. Liu H. Liu X.-sh. Sriboonchitta S., “On Structure and Distances of Some Classes of Repeated-Root Constacyclic Codes Over Galois Rings”, Finite Fields their Appl., 43 (2017), 86–105          
35. Alexander Barg, Woomyoung Park, “On linear ordered codes”, Mosc. Math. J., 15:4 (2015), 679–702      
36. Jain S., “Solid Bursts-From Hamming To Rt-Spaces”, ARS Comb., 123 (2015), 215–230    
37. Gluesing-Luerssen H., “Fourier-Reflexive Partitions and Macwilliams Identities For Additive Codes”, Des. Codes Cryptogr., 75:3 (2015), 543–563          
38. Jain S., “on Some Important Classes of Row-Cyclic Array Codes”, ARS Comb., 120 (2015), 305–320    
39. Barra A. Gluesing-Luerssen H., “Macwilliams Extension Theorems and the Local-Global Property For Codes Over Frobenius Rings”, J. Pure Appl. Algebr., 219:4 (2015), 703–728          
40. Goda T., “on the l (P) Discrepancy of Two-Dimensional Folded Hammersley Point Sets”, Arch. Math., 103:4 (2014), 389–398          
41. Limburg S., Grant D., Varanasi M.K., “Higher Genus Universally Decodable Matrices (Udmg)”, Adv. Math. Commun., 8:3 (2014), 257–270        
42. Jain S., “on a Class of Blockwise-Bursts in Array Codes”, ARS Comb., 114 (2014), 273–292      
43. Dick J., “Discrepancy Bounds For Infinite-Dimensional Order Two Digital Sequences Over F-2”, J. Number Theory, 136 (2014), 204–232          
44. Barg A., Felix L.V., Firer M., Spreafico M.V.P., “Linear Codes on Posets With Extension Property”, Discrete Math., 317 (2014), 1–13          
45. Jain S., “on a Class of Cyclic Bursts in Array Codes”, ARS Comb., 113A (2014), 11–36      
46. Britz T., Johnsen T., Mayhew D., Shiromoto K., “Wei-type duality theorems for matroids”, Des Codes Cryptogr, 62:3 (2012), 331–341        
47. М. М. Скриганов, “О средних значениях $L_q$-уклонений точечных распределений”, Алгебра и анализ, 24:6 (2012), 196–225        ; M. M. Skriganov, “On mean values of the $L_q$-discrepancies of point distributions”, St. Petersburg Math. J., 24:6 (2013), 991–1012      
48. Pinheiro J.A., Firer M., “Classification of Poset-Block Spaces Admitting Macwilliams-Type Identity”, IEEE Trans. Inf. Theory, 58:12 (2012), 7246–7252      
49. Felix L.V., Firer M., “Canonical- Systematic Form for Codes in Hierarchical Poset Metrics”, Adv. Math. Commun., 6:3 (2012), 315–328        
50. Barg A., Firer M., “Translation Association Schemes, Poset Metrics, and the Shape Enumerator of Codes”, 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE International Symposium on Information Theory, IEEE, 2012, 101–105  
51. Rajkumar R., “Coding the Vertices of a Graph with Rosenbloom-Tsfasman Metric”, Mathematical Modelling and Scientific Computation, Communications in Computer and Information Science, 283, eds. Balasubramaniam P., Uthayakumar R., Springer-Verlag Berlin, 2012, 97–103      
52. Firer M., Panek L., Rifo L.L.R., “Bayes Decoding for Discrete Linear Channels with Semantic Value of Information”, XI Brazilian Meeting on Bayesian Statistics (Ebeb 2012), AIP Conference Proceedings, 1490, eds. Stern J., Lauretto M., Polpo A., Diniz M., Amer Inst Physics, 2012, 126–134    
53. Kim D.S., Kim H.K., “Association Schemes and Macwilliams Dualities for Generalized Niederreiter-Rosenbloom-Tsfasman Posets”, Diss. Math., 2012, no. 487, 5+    
54. Trinker H., “Cubic and higher degree bounds for codes and (t, m, s)-nets”, Des Codes Cryptogr, 60:2 (2011), 101–121        
55. Hyun J.Y., Lee Y., “MDS Poset-Codes Satisfying the Asymptotic Gilbert-Varshamov Bound in Hamming Weights”, IEEE Trans Inform Theory, 57:12 (2011), 8021–8026        
56. Trinker H., “The triple distribution of codes and ordered codes”, Discrete Math, 311:20 (2011), 2283–2294        
57. Kopparty S., Saraf Sh., Yekhanin S., “High-Rate Codes with Sublinear-Time Decoding”, Stoc 11: Proceedings of the 43rd Acm Symposium on Theory of Computing, 2011, 167–176      
58. Alves Marcelo Muniz S., “A Standard Form for Generator Matrices with Respect to the Niederreiter-Rosenbloom-Tsfasman Metric”, 2011 IEEE Information Theory Workshop (Itw), IEEE, 2011  
59. Schuerer R., Schmid W.Ch., “MINT-Architecture and applications of the (t, m, s)-net and OOA database”, Mathematics and Computers in Simulation, 80:6 (2010), 1124–1132        
60. Trinker H., “New explicit bounds for ordered codes and (t, m, s)-nets”, Discrete Math, 310:4 (2010), 970–975        
61. Jain S., “Array Codes in the Generalized Lee-Rt Pseudo-Metric (Glrtp-Metric)”, Algebr. Colloq., 17:1 (2010), 727–740        
62. Panek L., Firer M., Silva Alves M.M., “Classification of Niederreiter-Rosenbloom-Tsfasman Block Codes”, IEEE Trans. Inf. Theory, 56:10 (2010), 5207–5216      
63. Yildiz B., Siap I., Bilgin T., Yesilot G., “The Covering Problem for Finite Rings with Respect to the Rt-Metric”, Appl. Math. Lett., 23:9 (2010), 988–992        
64. Jain S., Shum K.P., “Correction of Ct Burst Array Errors in the Generalized-Lee-Rt Spaces”, Acta. Math. Sin.-English Ser., 26:8 (2010), 1475–1484        
65. Barg A., Purkayastha P., “Near Mds Poset Codes and Distributions”, Error-Correcting Codes, Finite Geometries and Cryptography, Contemporary Mathematics, 523, eds. Bruen A., Wehlau D., Amer Mathematical Soc, 2010, 135–147        
66. Hyun J.Y., “A Subgroup of the Full Poset-Isometry Group”, SIAM Discret. Math., 24:2 (2010), 589–599          
67. Barg A., Purkayastha P., “Near Mds Poset Codes and Distributions”, 2010 IEEE International Symposium on Information Theory, IEEE International Symposium on Information Theory, IEEE, 2010, 1310–1314    
68. Vasantha W.B., Rajkumar R., “A Class of Cayley Graph Interconnection Networks Based on Rosenbloom-Tsfasman Metric”, Iccnt 2009: Proceedings of the 2009 International Conference on Computer and Network Technology, eds. Mahadevan V., Zhou J., World Scientific Publ Co Pte Ltd, 2010, 66–72  
69. Alexander Barg, Punabrasu Purkayastha, “Bounds on ordered codes and orthogonal arrays”, Mosc. Math. J., 9:2 (2009), 211–243        
70. Schuerer R., Schmid W.Ch., “MINT - New Features and New Results”, Monte Carlo and Quasi-Monte Carlo Methods 2008, 2009, 171–189        
71. Martin W.J., Tanaka H., “Commutative Association Schemes”, Eur. J. Comb., 30:6 (2009), 1497–1525          
72. Panek L., Firer M., Silva Alves M.M., “Symmetry Groups of Rosenbloom-Tsfasman Spaces”, Discrete Math., 309:4 (2009), 763–771        
73. Trinker H., “A Simple Derivation of the Macwilliams Identity for Linear Ordered Codes and Orthogonal Arrays”, Des. Codes Cryptogr., 50:2 (2009), 229–234      
74. Schuerer R., “A new lower bound on the t-parameter of (t, s)-sequences”, Monte Carlo and Quasi-Monte Carlo Methods 2006, 2008, 623–632        
75. Jang Ch., Kim H.K., Oh D.Y., Rho Y., “The Poset Structures Admitting the Extended Binary Golay Code to Be a Perfect Code”, Discrete Math., 308:18 (2008), 4057–4068        
76. Panek L., Firer M., Kim H.K., Hyun J.Y., “Groups of Linear Isometries on Poset Structures”, Discrete Math., 308:18 (2008), 4116–4123        
77. Hyun J.Y., Kim H.K., “Maximum Distance Separable Poset Codes”, Des. Codes Cryptogr., 48:3 (2008), 247–261        
78. Jain S., “Ct Bursts-From Classical to Array Coding”, Discrete Math., 308:9 (2008), 1489–1499        
79. Jain S., “An Algorithmic Approach to Achieve Minimum Rho-Distance at Least D in Linear Array Codes”, Kyushu J. Math., 62:1 (2008), 189–200        
80. Alves Marcelo. Muniz. S., Panek L., Firer M., “Error-Block Codes and Poset Metrics”, Adv. Math. Commun., 2:1 (2008), 95–111          
81. Chen W.W.L., Skriganov M.M., “Orthogonality and Digit Shifts in the Classical Mean Squares Problem in Irregularities of Point Distribution”, Diophantine Approximation: Festschrift for Wolfgang Schmidt, Developments in Mathematics, 16, eds. Schlickewei H., Schmidt K., Tichy R., Springer, 2008, 141–159        
82. Niederreiter H., “Nets, (T, S)-Sequences, and Codes”, Monte Carlo and Quasi-Monte Carlo Methods 2006, eds. Keller A., Heinrich S., Niederreiter H., Springer-Verlag Berlin, 2008, 83–100        
83. Dick J., “Walsh Spaces Containing Smooth Functions and Quasi-Monte Carlo Rules of Arbitrary High Order”, SIAM J. Numer. Anal., 46:3 (2008), 1519–1553        
84. Quistofff J., “On Rosenbloom and Tsfasman's generalization of the hamming space”, Discrete Math, 307:21 (2007), 2514–2524      
85. Barg A., Purkayastha P., “Bounds on ordered codes and orthogonal arrays”, 2007 IEEE International Symposium on Information Theory Proceedings, 2007, 331–335    
86. Kim D.S., “Macwilliams-Type Identities for Fragment and Sphere Enumerators”, Eur. J. Comb., 28:1 (2007), 273–302        
87. Martin W.J., Visentin T.I., “A Dual Plotkin Bound for (T, M, S)-Nets”, IEEE Trans. Inf. Theory, 53:1 (2007), 411–415        
88. Jain S., “Campopiano-Type Bounds in Non-Hamming Array Coding”, Linear Alg. Appl., 420:1 (2007), 135–159        
89. Dick J., “Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions”, SIAM J. Numer. Anal., 45:5 (2007), 2141–2176        
90. Skriganov M.M., “On Linear Codes with Large Weights Simultaneously for the Rosenbloom-Tsfasman and Hamming Metrics”, J. Complex., 23:4-6 (2007), 926–936          
91. Ozen M., Siap I., “Codes Over Galois Rings with Respect to the Rosenbloom-Tsfasman Metric”, J. Frankl. Inst.-Eng. Appl. Math., 344:5 (2007), 790–799        
92. Ganesan A., Vontobel P.O., “On the Existence of Universally Decodable Matrices”, IEEE Trans. Inf. Theory, 53:7 (2007), 2572–2575        
93. Vontobel P.O., Ganesan A., “On Universally Decodable Matrices for Space-Time Coding”, Des. Codes Cryptogr., 41:3 (2006), 325–342          
94. Jain S., “Bursts in M-Metric Array Codes”, Linear Alg. Appl., 418:1 (2006), 130–141        
95. Ozen M., Siap I., “Linear Codes Over F-Q[U]/(U(S)) with Respect to the Rosenbloom-Tsfasman Metric”, Des. Codes Cryptogr., 38:1 (2006), 17–29        
96. Cho SH., Kim D., “Automorphism Group of the Crown-Weight Space”, Eur. J. Comb., 27:1 (2006), 90–100        
97. Skriganov M.M., “Harmonic Analysis on Totally Disconnected Groups and Irregularities of Point Distributions”, J. Reine Angew. Math., 600 (2006), 25–49          
98. Niederreiter H., “Constructions of (T, M, S)-Nets and (T, S)-Sequences”, Finite Fields their Appl., 11:3 (2005), 578–600          
99. Kim H., Oh D., “A Classification of Posets Admitting the Macwilliams Identity”, IEEE Trans. Inf. Theory, 51:4 (2005), 1424–1431        
100. Armand M., “Improved List Decoding of Generalized Reed-Solomon and Alternant Codes Over Galois Rings”, IEEE Trans. Inf. Theory, 51:2 (2005), 728–733        
101. Dougherty S., Shiromoto K., “Maximum Distance Codes in Mat(N,S)(Z(K)) with a Non-Hamming Metric and Uniform Distributions”, Des. Codes Cryptogr., 33:1 (2004), 45–61        
102. Siap I., Ozen M., “The Complete Weight Enumerator for Codes Over Mnxs(R)”, Appl. Math. Lett., 17:1 (2004), 65–69        
103. Xing C., Niederreiter H., “Digital Nets, Duality, and Algebraic Curves”, Monte Carlo and Quasi-Monte Carlo Methods 2002, ed. Niederreiter H., Springer-Verlag Berlin, 2004, 155–166        
104. Lee K., “The Automorphism Group of a Linear Space with the Rosenbloom-Tsfasman Metric”, Eur. J. Comb., 24:6 (2003), 607–612        
105. S. T. Dougherty, M. M. Skriganov, “MacWilliams duality and the Rosenbloom–Tsfasman metric”, Mosc. Math. J., 2:1 (2002), 81–97        
106. Dougherty S., Skriganov M., “Maximum Distance Separable Codes in the Rho Metric Over Arbitrary Alphabets”, J. Algebr. Comb., 16:1 (2002), 71–81        
107. Chen W., Skriganov M., “Explicit Constructions in the Classical Mean Squares Problem in Irregularities of Point Distribution”, J. Reine Angew. Math., 545 (2002), 67–95      
108. Bierbrauer J. Edel Y. Schmid W., “Coding-Theoretic Constructions for (T,M,S)-Nets and Ordered Orthogonal Arrays”, J. Comb Des., 10:6 (2002), 403–418        
109. Nielsen R., “A Class of Sudan-Decodable Codes”, IEEE Trans. Inf. Theory, 46:4 (2000), 1564–1572        
110. Nielsen R., “A Class of Sudan-Decodable Codes”, 2000 IEEE International Symposium on Information Theory, Proceedings, IEEE, 2000, 112    
111. Martin W., Stinson D., “Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets”, Can. J. Math.-J. Can. Math., 51:2 (1999), 326–346