We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of translation association schemes that originate from the groups of linear isometries of the space. We address questions of duality and invariants of codes, establishing a connection between the dual association scheme and the scheme defined on the dual poset (they are isomorphic if and only if the poset is self-dual). We further discuss invariants that play the role of weight enumerators of codes in the poset case. In the case of regular rooted trees such invariants are linked to the classical problem of tree isomorphism. We also study the question of whether these invariants are preserved under standard operations on posets such as the ordinal sum and the like. © 2013 Published by Elsevier B.V.3171113CCF0916919; NSF; National Science Foundation; CCF1217245; NSF; National Science Foundation; CCF1217894; NSF; National Science Foundation; DMS1101697; NSF; National Science FoundationAho, A., Hopcroft, J., Ullman, J.D., (1974) The Design and Analysis of Computer Algorithms, , Addison-Wesley Publishing Co. Reading, MAAlves, M.M.S., A standard form for generator matrices with respect to the Niederreiter-Rosenbloom-Tsfasman metric (2011) Proc. 2011 IEEE Information Theory Workshop, pp. 486-489. , 16-20 Oct. Paraty, BrazilBarg, A., Firer, M., Translation association schemes and shape enumerators of codes (2012) Proc. 2012 IEEE Internat. Sympos. Information Theory, pp. 101-105. , Boston, MA, JulyBarg, A., Purkayastha, P., Bounds on ordered codes and orthogonal arrays (2009) Mosc. Math. J., 9 (2), pp. 211-243Brouwer, A.E., Cohen, A.M., Neumaier, A., (1989) Distance-Regular Graphs, , Springer-Verlag Berlin e. aBrualdi, R.A., Graves, J.S., Lawrence, K.M., Codes with a poset metric (1995) Discrete Math., 147 (13), pp. 57-72Ceccherini-Silberstein, T., Scarabotti, F., Tolli, F., (2008) Harmonic Analysis on Finite Groups, , Cambridge University PressChoi, S., Hyun, J.Y., Oh, D.Y., Kim, H.K., (2012) Mac-Williams Type Equivalence Relations, , arxiv:1205:1090Delsarte, P., An algebraic approach to the association schemes of coding theory (1973) Philips Res. Rep. Suppl., 10, pp. 1-97Delsarte, P., Association schemes and t-designs in regular semilattices (1976) J. Combin. Theory Ser. A, 20 (2), pp. 230-243Dougherty, S.T., Skriganov, M.M., MacWilliams duality and the Rosenbloom-Tsfasman metric (2002) Mosc. Math. J., 2 (1), pp. 81-97Felix, L.V., Firer, M., Canonical-systematic form for codes in hierarchical poset metrics (2012) Adv. Math. Commun., 6, pp. 315-328Gutiérrez, J.N., Tapia-Recillas, H., A MacWilliams identity for poset codes (1998) Congr. Numer., 133, pp. 63-73Hyun, J.Y., (2006) MacWilliams-type Equivalence Relations, , Ph.D. Thesis, Pohang University of Sciences and Technology, KoreaKim, D.S., Dual MacWilliams pairs (2005) IEEE Trans. Inform. Theory, 51 (8), pp. 2901-2905Kim, D.S., MacWilliams-type identities for fragment and sphere enumerators (2007) European Journal of Combinatorics, 28 (1), pp. 273-302. , DOI 10.1016/j.ejc.2005.07.018, PII S0195669805001526Kim, H.K., Oh, D.Y., A classification of posets-admitting the MacWilliams identity (2005) IEEE Transactions on Information Theory, 51 (4), pp. 1424-1431. , DOI 10.1109/TIT.2005.844067Lee, K., Automorphism group of the Rosenbloom-Tsfasman space (2003) European J. Combin., 24, pp. 607-612Lucas D'Oliveira, R.G., Firer, M., The Packing Radius of A Code and Partitioning Problems: The Case for Poset Metrics, , arxiv:1301.5915Macwilliams, F.J., Sloane, N.J.A., (1991) The Theory of Error-Correcting Codes, , North-Holland AmsterdamMartin, W.J., Stinson, D.R., Association schemes for ordered orthogonal arrays and (T, M, S) -nets (1999) Canad. J. Math., 51 (2), pp. 326-346Niederreiter, H., A combinatorial problem for vector spaces over finite fields (1991) Discrete Math., 96 (3), pp. 221-228Niederreiter, H., Digital nets and coding theory (2004) Coding Theory, Cryptography, and Combinatorics, pp. 247-257. , K. Feng, H. Niederreiter, C. Xing, Birkhäuser Basel e.aNielsen, R.R., A class of Sudan-decodable codes (2000) IEEE Trans. Inform. Theory, 46 (4), pp. 1564-1572Panek, L., Firer, M., Alves, M.M.S., Classification of Niederreiter-Rosenbloom-Tsfasman block codes (2010) IEEE Trans. Inform. Theory, 56 (10), pp. 5207-5216Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset structures (2008) Discrete Math., 308 (18), pp. 4116-4123Pinheiro, J.A., Firer, M., Classification of poset-block spaces admitting MacWilliams-type identity (2012) IEEE Trans. Inform. Theory, 58 (12), pp. 7246-7252Reed, R.C., The coding of various kinds of unlabeled trees (1972) Graph Theory and Computing, pp. 153-182. , Academic Press New YorkRosenbloom, M.Yu., Tsfasman, M.A., Codes for the m-metric (1997) Probl. Inf. Transm., 33 (1), pp. 45-52Schmerl, J.H., Countable homogeneous partially ordered sets (1979) Algebra Universalis, 9, pp. 317-321Skriganov, M.M., Coding theory and uniform distributions (2001) Algebra i Analiz, 13 (2), pp. 191-239. , English translation in St. Petersburg Math. J. 13 (2) (2002) 301-337Stanley, R.P., (2012) Enumerative Combinatorics. Volume 1, , second ed. Cambridge University Press Cambridge