Search results for "COD"

showing 10 items of 2985 documents

Diagonal space time hadamard codes with erasure decoding algorithm

2005

A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…

Prefix codeBlock codePolynomial codeComputer scienceConcatenationList decodingData_CODINGANDINFORMATIONTHEORYSequential decodingLocally testable codeSystematic codeReed–Solomon error correctionHadamard transformCyclic codeFadingLow-density parity-check codeComputer Science::Information TheorySelf-synchronizing codeHadamard codeConcatenated error correction codeReed–Muller codeSerial concatenated convolutional codesAntenna diversityLinear codeConvolutional codeErasureConstant-weight codeErasure codeAlgorithmDecoding methodsCommunication channelIEEE Wireless Communications and Networking Conference, 2005
researchProduct

Recent results on syntactic groups of prefix codes

2012

International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.

Prefix codeDiscrete mathematicsClass (set theory)Group (mathematics)010102 general mathematicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciencesPermutation group16. Peace & justice01 natural sciencesTransformation (music)Theoretical Computer SciencePrefixTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]010201 computation theory & mathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsArithmeticComputer Science::Formal Languages and Automata Theory[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]MathematicsEuropean Journal of Combinatorics
researchProduct

Transducers for the bidirectional decoding of prefix codes

2010

AbstractWe construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod (1999) in [5] and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding.We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of Girod’s encoding method. We prove that it has the same properties as those of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.

Prefix codeGeneral Computer ScienceSettore INF/01 - InformaticaGeneralizationComputer scienceGirod’s encodingTransducersPrefix codeTheoretical Computer SciencePrefixTransducerPrefix codesAlgorithmDecoding methodsWord (computer architecture)Computer Science(all)
researchProduct

Coding Sequences with Constraints

1990

In this paper we consider the following problem: given all bi-infinite sequences of symbols satisfying certain constraints, search for a set X of words such that i): any concatenation of elements of X satisfies these constraints and ii): any sequence verifying the constraints can be “parsed” in elements of X.

Prefix codeParsingFinite-state machineComputer sciencecomputer.software_genrecomputerAlgorithmCoding (social sciences)
researchProduct

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay

2012

Girod’s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph.

Prefix codeStrongly connected componentTheoretical computer scienceGeneralizationdeciphering delayData_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technology01 natural sciences[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Encoding (memory)0202 electrical engineering electronic engineering information engineeringCode (cryptography)Computer Science (miscellaneous)prefix (free) codeunlabeled graphMathematicsCode[MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]020206 networking & telecommunicationsCode; deciphering delay; prefix (free) code; strongly connected component; transducer; unlabeled graph; Computer Science (miscellaneous)Prefixtransducer[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]010201 computation theory & mathematicsGraph (abstract data type)strongly connected componentAlgorithmDecoding methods
researchProduct

Codes and automata

2006

Prefix codeTheoretical computer scienceFinite-state machineRegular languageComputer scienceDeterministic automatonAutomaton
researchProduct

La premialità nel diritto penale della crisi di impresa e dell'insolvenza: primi nodi interpretativi

2019

Il contributo si sofferma sulle misure premiali penali introdotte dal codice della crisi di impresa e dell’insolvenza, mettendone in evidenza i primi nodi interpretativi. The paper focuses on the criminal incentives introduced by the code of the business crisis and insolvency, putting in evidence the first critical profiles.

Premialità codice della crisi di impresa e dell'insolvenza diritto penale dell'economiaSettore IUS/17 - Diritto Penale
researchProduct

Steady state and transient thermal–hydraulic analyses on ITER divertor module

2005

Abstract One of the most challenging components of ITER is the divertor devoted at controlling the characteristics of the plasma boundary, exhausting the α particles and reducing the impurities in the plasma. The thermal–hydraulic design of the divertor is particularly, demanding because of the high heat loads and the cooling flow margin in the plasma-facing components (PFCs). The pressure drop is limited by the pumping power and also avoiding the risk of reaching critical heat flux (CHF). Furthermore, for maintenance operation foreseen, each single divertor cassette should be drained and dried before withdrawing it out from the vacuum vessel. To address these requirements, European Fusion …

Pressure dropTokamakMaterials scienceCritical heat fluxHydraulicsMechanical EngineeringNuclear engineeringDivertorFusion powerSteady statelaw.inventionThermal hydraulicsNuclear physicsDivertorTransient thermal–hydraulicNuclear Energy and EngineeringHeat fluxlawITERRELAP codeGeneral Materials ScienceSettore ING-IND/19 - Impianti NucleariCivil and Structural EngineeringFusion Engineering and Design
researchProduct

Glutamine Codon Usage and polyQ Evolution in Primates Depend on the Q Stretch Length

2018

Abstract Amino acid usage in a proteome depends mostly on its taxonomy, as it does the codon usage in transcriptomes. Here, we explore the level of variation in the codon usage of a specific amino acid, glutamine, in relation to the number of consecutive glutamine residues. We show that CAG triplets are consistently more abundant in short glutamine homorepeats (polyQ, four to eight residues) than in shorter glutamine stretches (one to three residues), leading to the evolutionary growth of the repeat region in a CAG-dependent manner. The length of orthologous polyQ regions is mostly stable in primates, particularly the short ones. Interestingly, given a short polyQ the CAG usage is higher in…

Primatescongenital hereditary and neonatal diseases and abnormalitiescodon usageProteomeGlutaminehomorepeatEvolution MolecularAnimalsHumansglutamine stretchCodonPeptidespolyQ-associated diseasesResearch ArticleGenome Biology and Evolution
researchProduct

Pantilliset on tour : Code-switching in Finnish magazine advertisements

2010

 Mainonnan määrä lisääntyy eri medioissa ja sen myötä mainonta vaikuttaa käyttäytymiseemme yhä enemmän. Maailman globalisoituessa englannin kielen rooli muuttuu myös mainonnassa. Englanti on usein monikielisen mainonnan suosituin vieras kieli maailmanlaajuisesti ja sitä hyödynnetään suomalaisessa lehtimainonnassa yhä enenevässä määrin. Englannin kieltä sekä englannin ja suomen kielen välistä koodinvaihtoa suomalaisessa mainonnassa on tutkittu aiemminkin, mutta huomioimatta on jäänyt englannin kielen määrä suomen kieleen verrattuna. Tämän kandidaatintutkielman tarkoituksena oli selvittää missä suhteessa suomen kieli on korvattu englannin kielellä kahden suomalaisen yleisaikakauslehtien, Imag…

Print advertisingEnglish as a lingua francacode-switching
researchProduct