Bibliografie tematiche / Coding theor

Letteratura scientifica selezionata sul tema "Coding theor"

Autore: Grafiati
Pubblicato: 4 giugno 2021
Ultima modifica: 1 febbraio 2022

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Indice

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Coding theor".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Coding theor"

1

Fimmel, Elena, Christian J. Michel e Lutz Strüngmann. "n -Nucleotide circular codes in graph theory". Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 374, n. 2063 (13 marzo 2016): 20150058. http://dx.doi.org/10.1098/rsta.2015.0058.

Testo completo
Abstract (sommario):
The circular code theory proposes that genes are constituted of two trinucleotide codes: the classical genetic code with 61 trinucleotides for coding the 20 amino acids (except the three stop codons { TAA , TAG , TGA }) and a circular code based on 20 trinucleotides for retrieving, maintaining and synchronizing the reading frame. It relies on two main results: the identification of a maximal C 3 self-complementary trinucleotide circular code X in genes of bacteria, eukaryotes, plasmids and viruses (Michel 2015 J. Theor. Biol. 380, 156–177. ( doi:10.1016/j.jtbi.2015.04.009 ); Arquès & Michel 1996 J. Theor. Biol. 182, 45–58. ( doi:10.1006/jtbi.1996.0142 )) and the finding of X circular code motifs in tRNAs and rRNAs, in particular in the ribosome decoding centre (Michel 2012 Comput. Biol. Chem. 37, 24–37. ( doi:10.1016/j.compbiolchem.2011.10.002 ); El Soufi & Michel 2014 Comput. Biol. Chem. 52, 9–17. ( doi:10.1016/j.compbiolchem.2014.08.001 )). The univerally conserved nucleotides A1492 and A1493 and the conserved nucleotide G530 are included in X circular code motifs. Recently, dinucleotide circular codes were also investigated (Michel & Pirillo 2013 ISRN Biomath. 2013, 538631. ( doi:10.1155/2013/538631 ); Fimmel et al. 2015 J. Theor. Biol. 386, 159–165. ( doi:10.1016/j.jtbi.2015.08.034 )). As the genetic motifs of different lengths are ubiquitous in genes and genomes, we introduce a new approach based on graph theory to study in full generality n -nucleotide circular codes X , i.e. of length 2 (dinucleotide), 3 (trinucleotide), 4 (tetranucleotide), etc. Indeed, we prove that an n -nucleotide code X is circular if and only if the corresponding graph is acyclic. Moreover, the maximal length of a path in corresponds to the window of nucleotides in a sequence for detecting the correct reading frame. Finally, the graph theory of tournaments is applied to the study of dinucleotide circular codes. It has full equivalence between the combinatorics theory (Michel & Pirillo 2013 ISRN Biomath. 2013, 538631. ( doi:10.1155/2013/538631 )) and the group theory (Fimmel et al. 2015 J. Theor. Biol. 386, 159–165. ( doi:10.1016/j.jtbi.2015.08.034 )) of dinucleotide circular codes while its mathematical approach is simpler.
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Stine, Robert A. "Coding theory". Wiley Interdisciplinary Reviews: Computational Statistics 1, n. 3 (novembre 2009): 261–70. http://dx.doi.org/10.1002/wics.42.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Greferath, Marcus, Camilla Hollanti e Joachim Rosenthal. "Contemporary Coding Theory". Oberwolfach Reports 16, n. 1 (26 febbraio 2020): 773–840. http://dx.doi.org/10.4171/owr/2019/13.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

SAKATA, Shojiro. "Algebraic Coding Theory". IEICE ESS Fundamentals Review 1, n. 3 (2008): 3_44–3_57. http://dx.doi.org/10.1587/essfr.1.3_44.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

van Lint, J. H. "Coding theory introduction". IEEE Transactions on Information Theory 34, n. 5 (settembre 1988): 1274–75. http://dx.doi.org/10.1109/tit.1988.8862503.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Sokyska, Olha. "PROSODIC ORGANISATION OF REFUSAL UTTERANCES: THEIR CORRECT CODING, DECODING AND ACTUALISATION IN ENGLISH DIALOGUE SPEECH". Naukovì zapiski Nacìonalʹnogo unìversitetu «Ostrozʹka akademìâ». Serìâ «Fìlologìâ» 1, n. 10(78) (27 febbraio 2020): 198–202. http://dx.doi.org/10.25264/2519-2558-2020-10(78)-198-202.

Testo completo
Abstract (sommario):
The article focuses on the specificity of correct coding and decoding of refusal utterances in English dialogue speech and their intonation patterns taking full account of the importance of a communicative context in which the utterances occur. The author states that the communicative context to be considered while perceiving the refusal intonation patterns includes the following complex of factors: the communicative situation (formal, informal), the relation of speaker’s social status to the recipient’s status (higher, equal, and lower), the explicit or implicit form of the refusal, the speaker’s socio-cultural level (high. mid, low), emotional-and-pragmatic potential of the utterance (high, mid, low) as well as the class of reasons for the refusal utterances generation “I do not want to”, “I cannot”, “I can but I do not want to”, “I want but I cannot”). In this paper the author studies the suprasegmental level means contributing to correct coding and decoding of the utterance information and the speaker’s emotional state and his/her pragmatic intention. 70 students of Igor Sikorsky Kyiv Polytechnic Institute aged 18-21 took part in the experiment. The author reports the results of the study of difficulties experienced by learners while mastering intonation patterns of English refusal utterances. The results of the research prove that intonation plays the leading role in correct encoding and decoding of refusal utterances’ meaning.
Gli stili APA, Harvard, Vancouver, ISO e altri
7

CHEN, CHEN, YING MA, LEI LEI, MOHAMMAD GAREEB e KAN JIANG. "RESONANCE BETWEEN SELF-SIMILAR SETS AND THEIR UNIVOQUE SETS". Fractals 29, n. 05 (18 giugno 2021): 2150111. http://dx.doi.org/10.1142/s0218348x21501115.

Testo completo
Abstract (sommario):
Let [Formula: see text] be a self-similar set in [Formula: see text]. Generally, if the iterated function system (IFS) of [Formula: see text] has some overlaps, then some points in [Formula: see text] may have multiple codings. If an [Formula: see text] has a unique coding, then we call [Formula: see text] a univoque point. We denote by [Formula: see text] (univoque set) the set of points in [Formula: see text] having unique codings. In this paper, we shall consider the following natural question: if two self-similar sets are bi-Lipschitz equivalent, then are their associated univoque sets also bi-Lipschitz equivalent. We give a class of self-similar sets with overlaps, and answer the above question affirmatively.
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Bracken, Carl. "Pseudo quasi-3 designs and their applications to coding theory". Journal of Combinatorial Designs 17, n. 5 (settembre 2009): 411–18. http://dx.doi.org/10.1002/jcd.20208.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Chinen, Koji, e Toyokazu Hiramatsu. "Hyper-Kloosterman Sums and their Applications to the Coding Theory". Applicable Algebra in Engineering, Communication and Computing 12, n. 5 (1 ottobre 2001): 381–90. http://dx.doi.org/10.1007/s002000100080.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Sasaki, M. "Toward implementation of coding for quantum sources and channels". Quantum Information and Computation 4, n. 6&7 (dicembre 2004): 526–36. http://dx.doi.org/10.26421/qic4.6-7-11.

Testo completo
Abstract (sommario):
We review our experiment on quantum source and channel codings, the most fundamental operations in quantum info-communications. For both codings, entangling letter states is essential. Our model is based on the polarization-location coding, and a quasi-single photon linear optics implementation to entangle the polarization and location degrees of freedom. Using single-photon events in a subset of possible cases, we simulate quantum coding-decoding operations for nonorthogonal states under the quasi-pure state condition. In the quantum channel coding, we double the spatial bandwidth (number of optical paths), and demonstrate the information more than double can be transmitted. In the quantum source coding, we halve the spatial bandwidth to compress the data and decompress the original data with the high fidelity approaching the theoretical limit.
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Tesi sul tema "Coding theor"

1

Pinnawala, Nimalsiri, e nimalsiri pinnawala@rmit edu au. "Properties of Trace Maps and their Applications to Coding Theory". RMIT University. Mathematical and Geospatial Sciences, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080515.121603.

Testo completo
Abstract (sommario):
In this thesis we study the application of trace maps over Galois fields and Galois rings in the construction of non-binary linear and non-linear codes and mutually unbiased bases. Properties of the trace map over the Galois fields and Galois rings has been used very successfully in the construction of cocyclic Hadamard, complex Hadamard and Butson Hadamard matrices and consequently to construct linear codes over integers modulo prime and prime powers. These results provide motivation to extend this work to construct codes over integers modulo . The prime factorization of integers paved the way to focus our attention on the direct product of Galois rings and Galois fields of the same degree. We define a new map over the direct product of Galois rings and Galois fields by using the usual trace maps. We study the fundamental properties of the this map and notice that these are very similar to that of the trace map over Galois rings and Galois fields. As such this map called the trace-like map and is used to construct cocyclic Butson Hadamard matrices and consequently to construct linear codes over integers modulo . We notice that the codes construct in this way over the integers modulo 6 is simplex code of type . A further generalization of the trace-like map called the weighted-trace map is defined over the direct product of Galois rings and Galois fields of different degrees. We use the weighted-trace map to construct some non-linear codes and mutually unbiased bases of odd integer dimensions. Further more we study the distribution of over the Galois fields of degree 2 and use it to construct 2-dimensional, two-weight, self-orthogonal codes and constant weight codes over integers modulo prime.
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Ryzhikov, Andrew. "Synchronizing automata and coding theory". Thesis, Paris Est, 2020. http://www.theses.fr/2020PESC2030.

Testo completo
Abstract (sommario):
Cette thèse est consacrée a l’étude des mots synchronisant pour les automates finis et les codes. Intuitivement, un mot synchronisant est tel que son application amène le système dans un état indépendant de l'état initial. Un code ou un automate est synchronisant s’il admet un mot synchronisant. Il existe une forte relation entre l’utilisation de cette notion pour les automates ou les codes et son usage est l’un des leitmotifs de cette thèse.Un des principaux outils pour traiter les codes est l’usage d’un automate particulier préservant ses propriétés de synchronisation. Pour les codes préfixes, ceci est obtenu en utilisant un automate déterministe.Nous avons exploré deux problèmes principaux concernant la synchronisation. Le premier consiste à mesurer la longueur du plus court mot synchronisant pour un automate ou un code. Dans le cas d’un automate fini complet et déterministe, un des problèmes les plus anciens de la théorie combinatoire des automates propose une borne quadratique en termes du nombre d'états de l’automate. Nous étendons cette conjecture aux automates partiels non-déterministes. Nous établissons des bornes polynomiales pour ces classes en présence de la forte connexité, et nous discutons leur lien avec la conjecture originale de Černý.La relation avec les codes finis nous permet de prouver l’existence de bornes similaires en termes de la somme des longueurs des mots du code, et aussi de la longueur du plus long mot. Le deuxième cas est lié à une autre importante conjecture, proposée par Restivo. Elle concerne les mots mortels plutôt que synchronisant. Dans la plupart de ces cas, nous examinons aussi la complexité de calcul d’un mot synchronisant court, un deuxième aspect fondamental de cette thèse. Au-delà, nous étudions plusieurs généralisations de la notion de mot synchronisant, qui permettent d’utiliser une information partielle sur sur l’état dans lequel se trouve l’automate. Pour plusieurs de ces généralisations, nous prouvons des bornes inférieures de complexité, même dans ce cas très particuliers
This thesis is devoted to studying synchronizing words for finite automata and variable-length codes. Intuitively, a synchronizing word is a word such that its application brings a system into some particular state regardless of its initial state. A code or automaton is synchronizing if it admits a synchronizing word. There is a deep connection between the concrete implementations of this notion for finite automata and variable-length codes, and the use of it is one of the leitmotifs of this thesis.One of the main tools for dealing with variable-length codes is assigning a special automaton preserving many synchronization properties to it. For finite codes, this is done using prefix automata.We investigate two fundamental problems about synchronization. The first one is measuring the length of shortest synchronizing words for synchronizing automata and codes. For the case of complete deterministic finite automata, the Černý conjecture, one of the oldest problems in combinatorial automata theory, proposes a quadratic upper bound in terms of the number of states in the automaton. We broaden this conjecture to partial deterministic finite automata and then to unambiguous non-deterministic finite automata. We show polynomial upper bounds for mentioned classes in the presence of strong connectivity, and discuss their connections with the original Černý conjecture.The relation with finite codes allows us to show similar bounds in terms of the sum of the lengths of the codewords, as well as in terms of the length of the longest codeword. The second case is related to another important conjecture stated by Restivo. It deals with mortal words instead of synchronizing ones, the case which we also investigate. For most of these settings we also examine the computational complexity of finding short synchronizing words, which is the second fundamental question investigated in this thesis. Besides that, we study various generalization of the notion of a synchronizing word, which allow to use some partial information about the current state of an automaton. For several such generalizations we show strong computational complexity lower bounds even in very restricted cases
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Redwood-Sawyerr, J. A. S. "Constant envelope modulation coding". Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356049.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Chaiyaboonthanit, Thanit. "Image coding using wavelet transform and adaptive block truncation coding /". Online version of thesis, 1991. http://hdl.handle.net/1850/10913.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Cohen, D. A. "A problem in algebraic coding theory". Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380002.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Arslan, Ogul. "Some algebraic problems from coding theory". [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0024938.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Adistambha, Kevin. "Embedded lossless audio coding using linear prediction and cascade coding". Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060724.122433/index.html.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Delopoulos, Athanasios. "Coding techniques for moving images". Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338648.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Kaouri, Hussein Ali. "Speech coding using vector quantisation". Thesis, Queen's University Belfast, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356934.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Allott, David. "Efficient source coding for digital images". Thesis, Loughborough University, 1985. https://dspace.lboro.ac.uk/2134/27563.

Testo completo
Abstract (sommario):
A requirement exists for interactive view-data systems to incorporate some facility for the transmission of good quality multi-level single-frame images (both monochrome and colour) for both general information services and more commercial applications such as mail order catalogues.
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Libri sul tema "Coding theor"

1

1966-, Urbanke R., a cura di. Modern coding theory. New York, NY: Cambridge University Press, 2008.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

M, Gray Robert. Source Coding Theory. Boston, MA: Springer US, 1989.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Gray, Robert M. Source Coding Theory. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-1643-5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

M, Gray Robert. Source coding theory. Boston: Kluwer Academic Publishers, 1990.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Kelly, James F. Coding. New York, NY: Dorling Kindersley, 2017.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Hiramatsu, Toyokazu. Coding Theory and Number Theory. Dordrecht: Springer Netherlands, 2003.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Hiramatsu, Toyokazu, e Günter Köhler. Coding Theory and Number Theory. Dordrecht: Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-017-0305-5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Ray-Chaudhuri, Dijen, a cura di. Coding Theory and Design Theory. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4615-6654-0.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Ray-Chaudhuri, Dijen. Coding Theory and Design Theory. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-8994-1.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Lint, Jacobus Hendricus van. Introduction to coding theory. 3a ed. Berlin: Springer, 1999.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Capitoli di libri sul tema "Coding theor"

1

O’Regan, Gerard. "Coding Theory". In Undergraduate Topics in Computer Science, 171–83. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-34209-8_11.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Cohn, P. M. "Coding Theory". In Further Algebra and Applications, 371–93. London: Springer London, 2003. http://dx.doi.org/10.1007/978-1-4471-0039-3_10.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Niederreiter, Harald, e Arne Winterhof. "Coding Theory". In Applied Number Theory, 99–183. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22321-6_3.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

O’Regan, Gerard. "Coding Theory". In Mathematics in Computing, 155–69. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4534-9_9.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Brophy, Tim. "Coding Theory". In Real-World Problems for Secondary School Mathematics Students, 67–85. Rotterdam: SensePublishers, 2011. http://dx.doi.org/10.1007/978-94-6091-543-7_3.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Lidl, Rudolf, e Günter Pilz. "Coding Theory". In Undergraduate Texts in Mathematics, 183–238. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4757-2941-2_4.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Benfattoum, Youghourta, Steven Martin e Khaldoun Al Agha. "Network Coding: From Theory to Practice". In Network Coding, 1–26. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118562819.ch1.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Biggs, Norman L. "Algebraic coding theory". In Springer Undergraduate Mathematics Series, 1–22. London: Springer London, 2008. http://dx.doi.org/10.1007/978-1-84800-273-9_9.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Mullen, Gary, e Carl Mummert. "Algebraic coding theory". In The Student Mathematical Library, 79–108. Providence, Rhode Island: American Mathematical Society, 2007. http://dx.doi.org/10.1090/stml/041/03.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Rubinstein-Salzedo, Simon. "Some Coding Theory". In Springer Undergraduate Mathematics Series, 231–50. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94818-8_20.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Coding theor"

1

Xin Jin e S. Goto. "A 18.42 times faster video encoder based on Retinex theory". In 2012 Picture Coding Symposium (PCS). IEEE, 2012. http://dx.doi.org/10.1109/pcs.2012.6213257.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

de-Frutos-Lopez, M., A. B. Mejia-Ocana, Sergio Sanz-Rodriguez, C. Pelaez-Moreno, F. Diaz-de-Maria e Z. Pizlo. "A simplified subjective video quality assessment method based on signal detection theory". In 2012 Picture Coding Symposium (PCS). IEEE, 2012. http://dx.doi.org/10.1109/pcs.2012.6213336.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Xu, Xiaoli, Satyajit Thakor e Yong Liang Guan. "Reduced Functional dependence graphs and their applications". In 2012 International Symposium on Network Coding (NetCod). IEEE, 2012. http://dx.doi.org/10.1109/netcod.2012.6261885.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Wieckowski, Adam, Benjamin Bross e Detlev Marpe. "Fast partitioning strategies for VVC and their implementation in an Open Optimized Encoder". In 2021 Picture Coding Symposium (PCS). IEEE, 2021. http://dx.doi.org/10.1109/pcs50896.2021.9477510.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Bayles, Brenda K. Krkosska. "A Mathematical Formula Predicts the Third Base Wobble in Codons". In ASME 2017 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/imece2017-70005.

Testo completo
Abstract (sommario):
The 64 codons of the genetic code determine which amino acids are linked into a sequence to produce protein synthesis. Some of the codons specify the same amino acid by using only the first two letters of their codon triplet to do so, thus rendering their 3rd base irrelevant. Crick called this the wobble hypothesis, and a more complete understanding of the reading process could someday lead to a drug that can repair a misreading or to the creation of synthetic ribosomes capable of healthy protein synthesis. A step towards this goal is to apply mathematical logic to the 64 codons so that experimental results can be reproduced and to answer the specific question, how can the nucleotides in the three base positions be interpreted using mathematical code? Here it is shown that a mathematical formula derived from fluid mechanics predicts which codons in the dictionary will encode using their 3rd bases and which ones will not.
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Solov’eva, Faina I. "Coding theory and cryptology". In PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON CONSTRUCTION AND BUILDING ENGINEERING (ICONBUILD) 2017: Smart Construction Towards Global Challenges. Author(s), 2017. http://dx.doi.org/10.1063/1.5012616.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Lim, Sung Hoon, Young-Han Kim, Abbas El Gamal e Sae-Young Chung. "Noisy network coding". In 2010 IEEE Information Theory Workshop on Information Theory (ITW). IEEE, 2010. http://dx.doi.org/10.1109/itwksps.2010.5503216.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Gomez, Arley, Carolina Mejia e J. Andres Montoya. "Network coding and the model theory of linear information inequalities". In 2014 International Symposium on Network Coding (NetCod). IEEE, 2014. http://dx.doi.org/10.1109/netcod.2014.6892127.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Li, S. Y. R., e Q. T. Sun. "Network coding theory via commutative algebra". In 2009 Workshop on Network Coding, Theory, and Applications (NetCod). IEEE, 2009. http://dx.doi.org/10.1109/netcod.2009.5191387.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Liu, Yucheng, Parastoo Sadeghi e Young-Han Kim. "Three-Layer Composite Coding for Index Coding". In 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613351.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "Coding theor"

1

Moran, William. Coding Theory Information Theory and Radar. Fort Belvoir, VA: Defense Technical Information Center, settembre 2005. http://dx.doi.org/10.21236/ada456510.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Calderbank, Arthur R. Coding Theory Information Theory and Radar. Fort Belvoir, VA: Defense Technical Information Center, gennaio 2005. http://dx.doi.org/10.21236/ada434253.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Xia, Xiang-Gen. Space-Time Coding Using Algebraic Number Theory for Broadband Wireless Communications. Fort Belvoir, VA: Defense Technical Information Center, maggio 2008. http://dx.doi.org/10.21236/ada483791.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Smith, David I. Highly Conserved, Large, Non-Coding Transcripts and Their Role in the Development of Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, agosto 2008. http://dx.doi.org/10.21236/ada493371.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Hossain, Niamat Ullah Ibne, Raed Jaradat, Michael Hamilton, Charles Keating e Simon Goerger. A historical perspective on development of systems engineering discipline : a review and analysis. Engineer Research and Development Center (U.S.), aprile 2021. http://dx.doi.org/10.21079/11681/40259.

Testo completo
Abstract (sommario):
Since its inception, Systems Engineering (SE) has developed as a distinctive discipline, and there has been significant progress in this field in the past two decades. Compared to other engineering disciplines, SE is not affirmed by a set of underlying fundamental propositions, instead it has emerged as a set of best practices to deal with intricacies stemming from the stochastic nature of engineering complex systems and addressing their problems. Since the existing methodologies and paradigms (dominant pat- terns of thought and concepts) of SE are very diverse and somewhat fragmented. This appears to create some confusion regarding the design, deployment, operation, and application of SE. The purpose of this paper is 1) to delineate the development of SE from 1926-2017 based on insights derived from a histogram analysis, 2) to discuss the different paradigms and school of thoughts related to SE, 3) to derive a set of fundamental attributes of SE using advanced coding techniques and analysis, and 4) to present a newly developed instrument that could assess the performance of systems engineers. More than Two hundred and fifty different sources have been reviewed in this research in order to demonstrate the development trajectory of the SE discipline based on the frequency of publication.
Gli stili APA, Harvard, Vancouver, ISO e altri
6

DiGrande, Laura, Sue Pedrazzani, Elizabeth Kinyara, Melanie Hymes, Shawn Karns, Donna Rhodes e Alanna Moshfegh. Field Interviewer– Administered Dietary Recalls in Participants’ Homes: A Feasibility Study Using the US Department of Agriculture’s Automated Multiple-Pass Method. RTI Press, maggio 2021. http://dx.doi.org/10.3768/rtipress.2021.mr.0045.2105.

Testo completo
Abstract (sommario):
Objective: The purpose of this study was to assess the feasibility of administering the Automated Multiple-Pass Method (AMPM), a widely used tool for collecting 24-hour dietary recalls, in participants’ homes by field interviewers. Design: The design included computer-assisted personal interviews led by either a nutritionist (standard) or field interviewer. Portion estimators tested were a set of three-dimensional food models (standard), a two-dimensional food model booklet, or a tablet with digital images rendered via augmented reality. Setting: Residences in central North Carolina. Participants: English-speaking adults. Pregnant women and individuals who were fasting were excluded. Results: Among 133 interviews, most took place in living rooms (52%) or kitchens (22%). Mean interview time was 40 minutes (range 13–90), with no difference by interviewer type or portion estimator, although timing for nutritionist-led interviews declined significantly over the study period. Forty-five percent of participants referenced items from their homes to facilitate recall and portion estimation. Data entry and post-interview coding was evaluated and determined to be consistent with requirements for the National Health and Nutrition Examination Survey. Values for the number of food items consumed, food groups, energy intake (average of 3,011 kcal for men and 2,105 kcal for women), and key nutrients were determined to be plausible and within reasonably expected ranges regardless of interviewer type or portion estimator used. Conclusions: AMPM dietary recall interviews conducted in the home are feasible and may be preferable to clinical administration because of comfort and the opportunity for participants to access home items for recall. AMPMs administered by field interviewers using the food model booklet produced credible nutrition data that was comparable to AMPMs administered by nutritionists. Training field interviewers in dietary recall and conducting home interviews may be sensible choices for nutrition studies when response rates and cost are concerns.
Gli stili APA, Harvard, Vancouver, ISO e altri
Ti possono interessare anche gli elenchi estesi di opere sul tema "Coding theor":
Articoli di riviste Tesi Libri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!

Vai alla bibliografia