1,720,967 research outputs found
Bayes decoding for discrete linear channels with semantic value of information
No full textIn this work we explore the decoding process when information words have different semantic values. In that setting, we introduce a convenient loss function that allows us to express the overall performance of a decoding scheme for discrete channels, switching the usual goal of minimizing the error probability to that of minimizing the expected loss. © 2012 American Institute of Physics.In this work we explore the decoding process when information words have different semantic values. In that setting, we introduce a convenient loss function that allows us to express the overall performance of a decoding scheme for discrete channels, swit14901126134sem informaçãosem informaçãoAnderson, J., Firer, M., (2011) Classification of poset-block spaces admitting MacWilliams-type identity -preprintAsh, R., Information Theory (1965) John Wiley & Sons, Inc.Barg, A., Purkayastha, P., Bounds on ordered codes and orthogonal arrays (2009) MoscowMathematical Journal, 9 (2), pp. 211-243Berlekamp, E.R., Mceliece, R.J., Tilborg, H.C.A.V., On the Inherent Intractability of Certain Coding Problems (1978) IEEE Transactions on Information Theory, 24 (3)Borade, S., Nakiboǧlu, B., Zheng, L., Unequal error protection: an information-theoretic perspective (2009) IEEE Transactions on Information Theory, 55 (12), pp. 5511-5539Brualdi, R., Graves, J.S., Lawrence, M., Codes with a poset metric (1995) Discrete Mathematics, 147, pp. 57-72Cover, T., Thomas, J.A., Elements of Information Theory (2006) John Wiley & SonsFelix, L.V., Firer, M., Canonical-Systematic Form of Hierarchical Codes (2011) pre-printHo, K.P., Kahn, J.M., Imagen Transmission over Noisy Channels Using Multicarrier Modulation (1997) Signal Processing: Image Comunication, 9, pp. 159-169Hyun, J.Y., Kim, H.K., The poset structures admitting the extended binary Hamming code to be a perfect code (2004) Discrete Mathematics, 288, pp. 37-47Hyun, J.Y., Kim, H.K., Maximum distance separable poset codes (2008) Designs, Codes and Cryptography, 48 (3), pp. 247-261Jang, C., Kim, H.K., Oh, D.Y., Rho, Y., The poset structures admitting the extended binary Golay code to be a perfect code (2008) Discrete Mathematics, 308, pp. 4057-4068Juba, B., Sudan, M., Universal semantics of Communication I - STOC'08 Proceedings of the 40th annual (2008) ACM symposium on Theory of computing, pp. 123-132Kim, H.K., Oh, D.Y., A Classification of Poset Admitting the MacWilliams Identity (2005) IEEE Transactions on Information Theory, 51 (4), pp. 1424-1431Kolmogorov, A.N., On the Shannon theory of information in the case of continuous signals (1956) IEEE Transactions on Information Theory, , SeptemberMasnick, B., Wolf, J., On linear unequal error protection codes (1967) IEEE Transactions on Information Theory, 3 (4), pp. 600-607Moura, A.D.O., Firer, M., Duality for poset codes (2010) IEEE Transactions on Information Theory, 56 (7), pp. 3180-3186Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset structures (2008) Discrete Mathematics, 308, pp. 4116-4123Panek, L., Firer, M., Alves, M.M.S., Symmetry groups of Rosenbloom-Tsfasman spaces (2009) Discrete Mathematics, 309, pp. 763-771Panek, L., Firer, M., Alves, M.M.S., Classification of Niederreiter-Rosenbloom-Tsfasman Block Codes (2010) IEEE Transactions on Information Theory, 56 (10), pp. 5207-5216Parmigiani, G., Inoue, L.Y., Decision Theory, Principles and Approaches (2009) Wiley, Cornwall, , UKYu Rosenbloom, M., Tsfasman, M.A., Codes for the m-metric (1997) Problems of Information Transmission, 33, pp. 45-52Sason, I., Shamai, S., Performance Analysis of Linear Codes under Maximum-Likelihood Decoding (2006) A Tutorial - Foundations and Trends in Communication and Information Theory, 3 (1-2), pp. 1-222Shannon, C.E., A mathematical theory of communication (1948) Bell System Tech. J., 27, pp. 379-423Shannon, C.E., Coding theorems for a discrete source with a fidelity criterion (1959) IRE Nat. Conv. Rec., , marchSchröder, B.S.W., Ordered Sets - An Introduction (2003) BirkhäuserTavildar, S., Viswanath, P., Approximately universal codes over slow-fading channels (2006) IEEE Transactions on Information Theory, 52 (7), pp. 3233-3258XI Brazilian Meeting on Bayesian StatisticsSignificant part of this work was developed during the summer of 2011, when M. Firer was at the Centre Interfacultaire Bernoulli at EPFL, Lausanne, Switzerland, supported by the Swiss National Science Foundation, to which he deeply thanks. The second au
Classification Of Niederreiter - Rosenbloom - Tsfasman Block Codes
No full textPoset and block metrics were introduced in recent years as alternative metrics to study error correcting codes. Poset-block codes were introduced in 2008, encompassing both poset and block metrics. In this paper, we study a family of such metrics, the Niederreiter-Rosenbloom-Tsfasman block metrics. In this context, we classify the classes of equivalent codes, describe canonical representatives of each class and develop much of the classical theory of error correcting codes for Niederreiter-Rosenbloom-Tsfasman block codes, including determination of packing radius and classification of MDS and perfect codes, determination of covering radius and characterization of quasi-perfect codes, and the description of an algorithm for syndrome decoding. © 2010 IEEE.561052075216Alves, M.M.S., Panek, L., Firer, M., Error-block codes and poset metrics (2008) Adv. Math. Commun., 2, pp. 95-111Brualdi, R.A., Graves, J.S., Lawrence, K.M., Codes with a poset metric (1995) Discrete Math., 147, pp. 57-72Feng, K., Xu, L., Hickernell, F.J., Linear error-block codes (2006) Finite Fields Appl., 12, pp. 638-652Hyun, J.Y., Kim, H.K., Maximum distance separable poset codes (2008) Des. Codes Cryptogr., 48 (3), pp. 247-261Huffman, W.C., Pless, V., (2003) Fundamentals of Error-Correcting Codes, , Cambridge, U.K.: Cambridge Univ. PressMacWilliams, F.J., Sloane, N.J.A., (1997) The Theory of Error-Correcting Codes, , Amsterdam: North-Holland Math. LibraryNiederreiter, H., Point sets and sequences with small discrepancy (1987) Monatsh. Math., 104, pp. 273-337Niederreiter, H., A combinatorial problem for vector spaces over finite fields (1991) Discrete Math., 96, pp. 221-228Niederreiter, H., Orthogonal array and other combinatorial aspects in the theory of uniform point distributions in unit cubes (1992) Discrete Math., 106-107, pp. 361-367Ozen, M., Siap, I., On the estructure and decoding of linear codes with respect to Rosenbloom-Tsfasman metric (2004) Selçuk J. Appl. Math., 5 (2), pp. 25-31Panek, L., Firer, M., Kim, H.K., Hyun, J.Y., Groups of linear isometries on poset structures (2008) Discrete Math., 308, pp. 4116-4123Rosenbloom, M.Y., Tsfasman, M.A., Codes for the μ-metric (1997) Probl. Inf. Transm., 33, pp. 45-52Wei, V.K., Generalized Hamming weights for linear codes (1991) IEEE Trans. Inf. Theory, 37, pp. 1412-1418Wei, V.K., Yang, K., On the generalized Hamming weights of product codes (1993) IEEE Trans. Inf. Theory, 39, pp. 1709-171
Counting Domains In {p,q} Tessellations
No full textFor any given regular {p,q} tessellation in the hyperbolic plane, we compute the number of vertices and tiles to be found as we distance from a given point, enabling a complete characterization of the asymptotic behavior. © 2003 Elsevier Science Ltd. All rights reserved.163323328Forney, Jr.G.D., Geometrically uniform codes (1991) IEEE Trams. Inform. Theory, 37, pp. 1241-1260Beardon, A.F., (1982) The Geometry of Discrete Groups, , Springer-VerlagDa Silva, E.B., Palazzo, Jr.R., Costa, S.R., Improving the performance of asymmetric M-PAM signal constellations in Euclidean space by embedding them in hyperbolic space (1998) Proceedings 1998 IEEE Information Theory Workshop, pp. 98-99. , June 22-26 Killarney, IrelandDa Silva, E.B., Palazzo, Jr.R., M-PSK signal constellations in hyperbolic space achieving better performance than the M-PSK signal constellations in Euclidean space (1999) 1999 IEEE Information Theory Workshop, , June 27-July 1 Metsovo, GreeceDa Silva, E.B., Pallazo, Jr.R., Firer, M., Performance analysis of QAM-like constellations in hyperbolic space (2000) International Symposium on Information Theory and Its Applications, pp. 568-571. , November 5-8 Honolulu, HIFirby, P.A., Gardiner, C.F., (1991) Surface Topology, , Second Edition Ellis Horwoo
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
koamabayili/VECTRON-author-checklist: VECTRON author checklist
No full textWe have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
- …
