Log in

Relevant bibliographies by topics / Search of maximal codes / Journal articles

Journal articles on the topic 'Search of maximal codes'

To see the other types of publications on this topic, follow the link: Search of maximal codes.

Author: Grafiati

Published: 30 May 2022

Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Search of maximal codes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

WONG, SHUI-WAI. "AKITA: A CAREER COUNSELING CASE FOR PRACTICE AND THEORETICAL REFLECTION." Hong Kong Journal of Social Work 54, no. 01n02 (January 2020): 51–66. http://dx.doi.org/10.1142/s0219246220000066.

Full text

Abstract:

A case in the Hong Kong Chinese context is presented in this paper to illustrate the use of both quantitative (Holland's SDS) and qualitative career assessment (Card Sorts) to help a 16-year-old girl overcome career indecision. Guided by both Holland's Hexagonal Career Types Theory and Socio-Cognitive Career Theory, a career counsellor can promote a client's positive changes after two counseling sessions. This case supports Tracey's (2002) and Nauta et al.'s (2002) postulated bidirectional causal path between self-efficacy and interests. In addition, it highlights that partial match instead of perfect match between Self-directed search (SDS) scores and choice of academic major is more pragmatic or effective while performing quantitative assessment. Finally, it points to the need for establishing local SDS norms, examining the Holland codes for occupations in Hong Kong, and researching the link between congruence and maximal career outcomes in future research.

APA, Harvard, Vancouver, ISO, and other styles

2

Abideen, Ahmed Zainul, Jaafar Pyeman, Veera Pandiyan Kaliani Sundram, Ming-Lang Tseng, and Shahryar Sorooshian. "Leveraging Capabilities of Technology into a Circular Supply Chain to Build Circular Business Models: A State-of-the-Art Systematic Review." Sustainability 13, no. 16 (August 11, 2021): 8997. http://dx.doi.org/10.3390/su13168997.

Full text

Abstract:

The recent technological inclusions in supply chains are encouraging practitioners to continuously rethink and redesign these supply chains. Organizations are trying to implement sustainable manufacturing and supply chain practices to utilize their resources to the full extent in order to gain a competitive advantage. Circular supply chain management acts as the main pathway to achieve optimal circular business models; however, research in this area is still in its infancy and there is a need to study and analyze how the benefits of technology can be leveraged in conventional models to impact circular supply chains and build smart, sustainable, circular business models. To gain better familiarity with the future research paradigms, a detailed systematic literature review was conducted on this topic to identify the dynamics of this field and domains deserving further academic attention. A holistic and unique review technique was used by the authors to capture maximal insights. A total of 96 publications from 2010 to 2021 were selected from the Web of Science core collection database through strict keyword search codes and exclusion criteria, with neat integration of systematic and bibliometric analyses. The findings of this study highlight the knowledge gaps and future research directions, which are presented at the end of this paper.

APA, Harvard, Vancouver, ISO, and other styles

3

Bruyère, Véronique, and Dominique Perrin. "Maximal bifix codes." Theoretical Computer Science 218, no. 1 (April 1999): 107–21. http://dx.doi.org/10.1016/s0304-3975(98)00253-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Alderson, T. L., and A. A. Bruen. "Maximal AMDS codes." Applicable Algebra in Engineering, Communication and Computing 19, no. 2 (February 15, 2008): 87–98. http://dx.doi.org/10.1007/s00200-008-0058-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Moulis, Guillaume, Maryse Lapeyre-Mestre, Jean-Louis Montastruc, Bertrand Godeau, and Laurent Sailler. "Vaccination Rates in Primary Immune Thrombocytopenia Adult Patients Exposed to Rituximab or Splenectomy. a Nationwide Population-Based Study in France." Blood 124, no. 21 (December 6, 2014): 2180. http://dx.doi.org/10.1182/blood.v124.21.2180.2180.

Full text

Abstract:

Abstract Background: International guidelines on immune thrombocytopenia (ITP) management recommend vaccination against Streptococcus pneumoniae (S.p.), Haemophilus influenza b (Hib) and Neisseiria meningitidis (N.m.) before splenectomy. French guidelines, published in 2009, state that these vaccines should be administered at least two weeks before splenectomy. They also recommend these vaccinations at least two weeks before rituximab, because 80% of rituximab-treated patients may relapse and may be candidate to splenectomy, while seroconversion is compromised the semester following rituximab. The aim of this study was to assess the application of these recommendations in France. Methods:The study was conducted in the database of the French national health insurance system (SNIIRAM). The French Adult Immune Thrombocytopenia: a French pHarmacoepidemiological study (FAITH, n°ENCEPP/SDPP/4574) is aimed at following in the SNIIRAM the cohort of all incident primary persistent or chronic ITP adult patients treated in France from 2009. The SNIIRAM collects prospectively all data regarding hospitalizations, disabling diseases, drug and procedure reimbursements. They are linkable with demographic data. On the 2009-2011 SNIIRAM data, ITP patients were identified with hospital and disabling disease diagnosis codes (D69.3 code of the International Classification of diseases, version-10 – ICD-10). The date of diagnosis was refined thanks to out-hospital drug exposures. Secondary ITPs were excluded thanks to diagnosis codes of diseases associated to ITP, searched in the year before and the semester after the diagnosis. We restricted to incident patients, excluding those with a diagnosis during the first semester of the study. Lastly, the FAITH cohort includes the patients persistently treated (at least three monthly consecutive dispensing of ITP drug, or exposure to rituximab or splenectomy). Among the 1106 patients of the FAITH cohort identified from July 2009 to June 2011, 427 non-splenectomized patients were exposed to rituximab and 178 underwent splenectomy (67 out of these had been previously exposed to rituximab). We assessed vaccine exposure to S.p., Hib and N.m. and detailed the moment of vaccinations. Vaccination was said “recommended” when it occurs prior to 2 weeks before rituximab or splenectomy. Other indications for vaccination (e.g. chronic pulmonary disease for S.p.vaccine) were searched through disabling diseases and in-hospital diagnosis codes before exposure to rituximab or splenectomy, using validated ICD-10 algorithms. Results: Among the 423 non-splenectomized patients exposed to rituximab, 137 (31.6%) were vaccinated against S.p., 80 (18.9%) against Hib, and 16 (3.8%) against N.m. Only 54 (12.8%) patients benefitted from a recommended vaccination against S.p. A similar pattern of recommended/non-recommended vaccination was observed for Hib and N.m. vaccines. Among the patients vaccinated after the first rituximab infusion, 28.5% (S.p.), 33.7% (Hib) and 37.5% (N.m.) were vaccinated during the 6 months following rituximab, corresponding to the time of maximal B-cell depletion. Forty-one patients (9.7%) had another reason for being vaccinated (mainly heart failure, n=23 and chronic pulmonary disease, n=13). Among them, 6 were vaccinated against S.p., 3 against Hib and none against N.m. Among the 111 splenectomized patients not previously exposed to rituximab, vaccination rates were 52.2% for S.p., 30.6% for Hib and 8.1% for N.m. When vaccinated against S.p., most patients (90.6%) benefitted from a recommended vaccination schedule (80.9% and 81.8% for Hib and N.m. vaccinations, respectively). Among the 67 patients exposed to rituximab before splenectomy, vaccination rates were 64.2% for S.p., 38.8% for Hib and 10.5% for N.m. Among S.p vaccinated patients, 79.6% had a recommended vaccination schedule before splenectomy (70.3% and 77.8% for Hib and N.m. vaccinations, respectively). However, 53.3 % of these recommended vaccinations occurred during the semester following a rituximab infusion (maximal B-cell depletion period). Seven of the 178 splenectomized patients had another reason for being vaccinated. Among them, 4 were vaccinated against S.p. and Hib, and 1 against N.m. Conclusions: Vaccination coverage is low before splenectomy or rituximab in ITP patients in France. Most of the vaccinations are dispensed during a non-recommended period. Disclosures No relevant conflicts of interest to declare.

APA, Harvard, Vancouver, ISO, and other styles

6

Burderi, Fabio. "Monoids and Maximal Codes." Electronic Proceedings in Theoretical Computer Science 63 (August 17, 2011): 83–92. http://dx.doi.org/10.4204/eptcs.63.12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lam, Nguyen Huong. "Finite maximal solid codes." Theoretical Computer Science 262, no. 1-2 (July 2001): 333–47. http://dx.doi.org/10.1016/s0304-3975(00)00277-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Guesnet, Yannick. "On maximal synchronous codes." Theoretical Computer Science 307, no. 1 (September 2003): 129–38. http://dx.doi.org/10.1016/s0304-3975(03)00097-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Foldes, Stephan, and Navin Singhi. "On maximal instantaneous codes." Electronic Notes in Discrete Mathematics 27 (October 2006): 27–28. http://dx.doi.org/10.1016/j.endm.2006.08.040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Liu, Yun. "Compositions of maximal codes." Theoretical Computer Science 411, no. 1 (January 2010): 228–38. http://dx.doi.org/10.1016/j.tcs.2009.09.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Shin, Sujin. "Codes and maximal monoids." Theoretical Computer Science 411, no. 16-18 (March 2010): 1809–17. http://dx.doi.org/10.1016/j.tcs.2010.01.035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Guesnet, Yannick. "Maximal circular codesversusmaximal codes." RAIRO - Theoretical Informatics and Applications 35, no. 4 (July 2001): 351–65. http://dx.doi.org/10.1051/ita:2001124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Lam, Nguyen Huong. "Finite Maximal Infix Codes." SemiGroup Forum 61, no. 3 (November 2000): 346–56. http://dx.doi.org/10.1007/pl00006033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Clark, Andy, and Chris Thornton. "Trading spaces: Computation, representation, and the limits of uninformed learning." Behavioral and Brain Sciences 20, no. 1 (March 1997): 57–66. http://dx.doi.org/10.1017/s0140525x97000022.

Full text

Abstract:

Some regularities enjoy only an attenuated existence in a body of training data. These are regularities whose statistical visibility depends on some systematic recoding of the data. The space of possible recodings is, however, infinitely large – it is the space of applicable Turing machines. As a result, mappings that pivot on such attenuated regularities cannot, in general, be found by brute-force search. The class of problems that present such mappings we call the class of “type-2 problems.” Type-1 problems, by contrast, present tractable problems of search insofar as the relevant regularities can be found by sampling the input data as originally coded. Type-2 problems, we suggest, present neither rare nor pathological cases. They are rife in biologically realistic settings and in domains ranging from simple animat (simulated animal or autonomous robot) behaviors to language acquisition. Not only are such problems rife – they are standardly solved! This presents a puzzle. How, given the statistical intractability of these type-2 cases, does nature turn the trick? One answer, which we do not pursue, is to suppose that evolution gifts us with exactly the right set of recoding biases so as to reduce specific type-2 problems to (tractable) type-1 mappings. Such a heavy-duty nativism is no doubt sometimes plausible. But we believe there are other, more general mechanisms also at work. Such mechanisms provide general (not task-specific) strategies for managing problems of type-2 complexity. Several such mechanisms are investigated. At the heart of each is a fundamental ploy – namely, the maximal exploitation of states of representation already achieved by prior, simpler (type-1) learning so as to reduce the amount of subsequent computational search. Such exploitation both characterizes and helps make unitary sense of a diverse range of mechanisms. These include simple incremental learning (Elman 1993), modular connectionism (Jacobs et al. 1991), and the developmental hypothesis of “representational redescription” (Karmiloff-Smith 1979; 1992). In addition, the most distinctive features of human cognition – language and culture – may themselves be viewed as adaptations enabling this representation/computation trade-off to be pursued on an even grander scale.

APA, Harvard, Vancouver, ISO, and other styles

15

Fimmel, Elena, and Lutz Strüngmann. "Maximal dinucleotide comma-free codes." Journal of Theoretical Biology 389 (January 2016): 206–13. http://dx.doi.org/10.1016/j.jtbi.2015.10.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Boyvalenkov, Peter, Danyo Danev, and Ivan Landgev. "On maximal Spherical codes II." Journal of Combinatorial Designs 7, no. 5 (1999): 316–26. http://dx.doi.org/10.1002/(sici)1520-6610(1999)7:5<316::aid-jcd2>3.0.co;2-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Durğun, Yilmaz. "Extended maximal self-orthogonal codes." Discrete Mathematics, Algorithms and Applications 11, no. 05 (October 2019): 1950052. http://dx.doi.org/10.1142/s1793830919500526.

Full text

Abstract:

Self-dual and maximal self-orthogonal codes over [Formula: see text], where [Formula: see text] is even or [Formula: see text](mod 4), are extensively studied in this paper. We prove that every maximal self-orthogonal code can be extended to a self-dual code as in the case of binary Golay code. Using these results, we show that a self-dual code can also be constructed by gluing theory even if the sum of the lengths of the gluing components is odd. Furthermore, the (Hamming) weight enumerator [Formula: see text] of a self-dual code [Formula: see text] is given in terms of a maximal self-orthogonal code [Formula: see text], where [Formula: see text] is obtained by the extension of [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

18

BURDERI, FABIO. "FULL MONOIDS AND MAXIMAL CODES." International Journal of Foundations of Computer Science 23, no. 08 (December 2012): 1677–90. http://dx.doi.org/10.1142/s0129054112400692.

Full text

Abstract:

In recent years codes that are not Uniquely Decipherable (UD) were studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a free monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal set. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maximal UD code. Finally we generalize some properties of UD codes.

APA, Harvard, Vancouver, ISO, and other styles

19

von zur Gathen, Joachim. "Maximal bilinear complexity and codes." Linear Algebra and its Applications 144 (January 1991): 49–61. http://dx.doi.org/10.1016/0024-3795(91)90060-a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Lu, Liangdong, Ruihu Li, and Luobin Guo. "Entanglement-assisted quantum codes from quaternary codes of dimension five." International Journal of Quantum Information 15, no. 03 (April 2017): 1750017. http://dx.doi.org/10.1142/s0219749917500174.

Full text

Abstract:

Maximal-entanglement entanglement-assisted quantum error-correcting codes (EAQE-CCs) can achieve the EA-hashing bound asymptotically and a higher rate and/or better noise suppression capability may be achieved by exploiting maximal entanglement. In this paper, we discussed the construction of quaternary zero radical (ZR) codes of dimension five with length [Formula: see text]. Using the obtained quaternary ZR codes, we construct many maximal-entanglement EAQECCs with very good parameters. Almost all of these EAQECCs are better than those obtained in the literature, and some of these EAQECCs are optimal codes.

APA, Harvard, Vancouver, ISO, and other styles

21

Li, Ruihu, Fei Zou, Yang Liu, and Zongben Xu. "Hermitian dual containing BCH codes and Construction of new quantum codes." Quantum Information and Computation 13, no. 1&2 (January 2013): 21–35. http://dx.doi.org/10.26421/qic13.1-2-3.

Full text

Abstract:

Let $q\geq 3$ be a prime power. Maximal designed distances of primitive Hermitian dual containing $q^{2}$-ary BCH codes (narrow-sense or non-narrow-sense) are determined by a careful analysis of properties of cyclotomic cosets. Non-narrow-sense BCH codes which achieve these maximal designed distances are presented, and a sequence of nested non-narrow-sense BCH codes that contain these BCH codes with maximal designed distances are constructed and their parameters are computed. Consequently, new nonbinary quantum BCH codes are derived from these non-narrow-sense BCH codes. The nonbinary quantum BCH codes presented here have better parameters than those quantum BCH codes available in the literature.

APA, Harvard, Vancouver, ISO, and other styles

22

Lu, Liangdong, Ruihu Li, Luobin Guo, and Qiang Fu. "Maximal entanglement entanglement-assisted quantum codes constructed from linear codes." Quantum Information Processing 14, no. 1 (September 26, 2014): 165–82. http://dx.doi.org/10.1007/s11128-014-0830-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Michel, Christian J., Marco Pellegrini, and Giuseppe Pirillo. "Maximal dinucleotide and trinucleotide circular codes." Journal of Theoretical Biology 389 (January 2016): 40–46. http://dx.doi.org/10.1016/j.jtbi.2015.08.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Abu-Mostafa, Y. S., and R. J. McEliece. "Maximal codeword lengths in Huffman codes." Computers & Mathematics with Applications 39, no. 11 (June 2000): 129–34. http://dx.doi.org/10.1016/s0898-1221(00)00119-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Jin, Lingfei. "Quantum Stabilizer Codes From Maximal Curves." IEEE Transactions on Information Theory 60, no. 1 (January 2014): 313–16. http://dx.doi.org/10.1109/tit.2013.2287694.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Maire, Christian, and Frédérique Oggier. "Maximal order codes over number fields." Journal of Pure and Applied Algebra 222, no. 7 (July 2018): 1827–58. http://dx.doi.org/10.1016/j.jpaa.2017.08.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

De Felice, Clelia, and Antonio Restivo. "Some results on finite maximal codes." RAIRO. Informatique théorique 19, no. 4 (1985): 383–403. http://dx.doi.org/10.1051/ita/1985190403831.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Bruyère, Vèronique. "Maximal codes with bounded deciphering delay." Theoretical Computer Science 84, no. 1 (July 1991): 53–76. http://dx.doi.org/10.1016/0304-3975(91)90260-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Liang, and Weide Qiu. "Decompositions of recognizable strong maximal codes." Theoretical Computer Science 108, no. 1 (February 1993): 173–83. http://dx.doi.org/10.1016/0304-3975(93)90235-l.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Yang, Jian-sheng, De-xiu Wang, and Qing-fang Jin. "Note on maximal distance separable codes." Journal of Shanghai University (English Edition) 13, no. 5 (October 2009): 409–11. http://dx.doi.org/10.1007/s11741-009-0513-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Carral, M., D. Rotillon, and A. Thiong Ly. "Codes defined from some maximal curves." Journal of Pure and Applied Algebra 67, no. 3 (November 1990): 247–57. http://dx.doi.org/10.1016/0022-4049(90)90046-k.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Zhang, Liang, and K. P. Shum. "Finite maximal codes and triangle conjecture." Discrete Mathematics 340, no. 3 (March 2017): 541–49. http://dx.doi.org/10.1016/j.disc.2016.10.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

De Winter, Stefaan, Cunsheng Ding, and Vladimir D. Tonchev. "Maximal arcs and extended cyclic codes." Designs, Codes and Cryptography 87, no. 4 (July 6, 2018): 807–16. http://dx.doi.org/10.1007/s10623-018-0514-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bartoli, Daniele, Massimo Giulietti, and Maria Montanucci. "Linear codes from Denniston maximal arcs." Designs, Codes and Cryptography 87, no. 4 (July 5, 2018): 795–806. http://dx.doi.org/10.1007/s10623-018-0515-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Bai, Liyan, Lianyan Jin, and Yun Liu. "Maximal Bifix Codes of Degree 3." Bulletin of the Malaysian Mathematical Sciences Society 41, no. 3 (July 8, 2016): 1393–407. http://dx.doi.org/10.1007/s40840-016-0399-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

LIU, YANG, YUENA MA, YOUQIAN FENG, and RUIHU LI. "NEW QUANTUM CODES CONSTRUCTED FROM A CLASS OF IMPRIMITIVE BCH CODES." International Journal of Quantum Information 11, no. 01 (February 2013): 1350006. http://dx.doi.org/10.1142/s0219749913500068.

Full text

Abstract:

By a careful analysis on cyclotomic cosets, the maximal designed distance δnew of narrow-sense imprimitive Euclidean dual containing q-ary BCH code of length [Formula: see text] is determined, where q is a prime power and l is odd. Our maximal designed distance δnew of dual containing narrow-sense BCH codes of length n improves upon the lower bound δmax for maximal designed distances of dual containing narrow-sense BCH codes given by Aly et al. [IEEE Trans. Inf. Theory53 (2007) 1183]. A series of non-narrow-sense dual containing BCH codes of length n, including the ones whose designed distances can achieve or exceed δnew, are given, and their dimensions are computed. Then new quantum BCH codes are constructed from these non-narrow-sense imprimitive BCH codes via Steane construction, and these new quantum codes are better than previous results in the literature.

APA, Harvard, Vancouver, ISO, and other styles

37

FAN, CHEN-MING, and H. J. SHYR. "SOME PROPERTIES OF MAXIMAL COMMA-FREE CODES." Tamkang Journal of Mathematics 29, no. 2 (June 1, 1998): 121–35. http://dx.doi.org/10.5556/j.tkjm.29.1998.4284.

Full text

Abstract:

A code $A$ over a finite alphabet $X$ is a comma-free code if $A^2\cap X^+AX^+=\emptyset$, where $X$ is a finite alphabet containing more than one letter. This paper is a study of some algebraic properties of finite maximal comma-free codes. We give several characterizations on two-element comma-free codes and maximal comma-free codes. Let $X_n^m= X^n\cup X^{n+1}\cup \cdots \cup X^m$. We prove that for $n \ge 3$ , a maximal comma-free code in $X^n$ is a maximal comma-free code in the region $X_1^m\cup X^n$, $m < n/2$. We also obtain that for $X = \{a,b\}$, a maximal comma-free code in $X^3$ is a maximal comma-free code; a maximal comma-free code in $X^4$ is a maximal comma-free code in $X_1^4$; for every $n\ge 4$, there is a maximal comma-free code in $X^n$ which is not a maximal comma-free code.

APA, Harvard, Vancouver, ISO, and other styles

38

Guo, Luobin, Yuena Ma, and Youqian Feng. "Quantum Codes Constructed from Self-Dual Codes and Maximal Self-Orthogonal Codes Over F5." Procedia Engineering 29 (2012): 3448–53. http://dx.doi.org/10.1016/j.proeng.2012.01.510.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Khmel'nik, S. I. "Search procedures using geometrical codes." Cybernetics 26, no. 6 (1991): 788–94. http://dx.doi.org/10.1007/bf01069486.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Dong Yang Long, Ma Jian, and Zhou Duanning. "Structure of 3-infix-outfix maximal codes." Theoretical Computer Science 188, no. 1-2 (November 1997): 231–40. http://dx.doi.org/10.1016/s0304-3975(97)00097-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bruyère, Véronique. "On maximal codes with bounded synchronization delay." Theoretical Computer Science 204, no. 1-2 (September 1998): 11–28. http://dx.doi.org/10.1016/s0304-3975(98)00028-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Calderini, Marco, and Giorgio Faina. "Generalized Algebraic Geometric Codes From Maximal Curves." IEEE Transactions on Information Theory 58, no. 4 (April 2012): 2386–96. http://dx.doi.org/10.1109/tit.2011.2177068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Heng, Ziling, Cunsheng Ding, and Weiqiong Wang. "Optimal Binary Linear Codes From Maximal Arcs." IEEE Transactions on Information Theory 66, no. 9 (September 2020): 5387–94. http://dx.doi.org/10.1109/tit.2020.2970405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Heden, Olof. "Maximal partial spreads and two-weight codes." Discrete Mathematics 62, no. 3 (December 1986): 277–93. http://dx.doi.org/10.1016/0012-365x(86)90215-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Puppe, V. "Group Actions and Codes." Canadian Journal of Mathematics 53, no. 1 (February 1, 2001): 212–24. http://dx.doi.org/10.4153/cjm-2001-009-0.

Full text

Abstract:

AbstractA 2-action with “maximal number of isolated fixed points” (i.e., with only isolated fixed points such that dimk(⊕iHi (M; k)) = |M2|, k = ) on a 3-dimensional, closed manifold determines a binary self-dual code of length = . In turn this code determines the cohomology algebra H*(M; k) and the equivariant cohomology . Hence, from results on binary self-dual codes one gets information about the cohomology type of 3-manifolds which admit involutions with maximal number of isolated fixed points. In particular, “most” cohomology types of closed 3-manifolds do not admit such involutions. Generalizations of the above result are possible in several directions, e.g., one gets that “most” cohomology types (over ) of closed 3-manifolds do not admit a non-trivial involution.

APA, Harvard, Vancouver, ISO, and other styles

46

Huber, Felix, and Markus Grassl. "Quantum Codes of Maximal Distance and Highly Entangled Subspaces." Quantum 4 (June 18, 2020): 284. http://dx.doi.org/10.22331/q-2020-06-18-284.

Full text

Abstract:

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length n of all QMDS codes with local dimension D and distance d≥3 is bounded by n≤D2+d−2. We obtain their weight distribution and present additional bounds that arise from Rains' shadow inequalities. Our main result can be seen as a generalization of bounds that are known for the two special cases of stabilizer QMDS codes and absolutely maximally entangled states, and confirms the quantum MDS conjecture in the special case of distance-three codes. As the existence of QMDS codes is linked to that of highly entangled subspaces (in which every vector has uniform r-body marginals) of maximal dimension, our methods directly carry over to address questions in multipartite entanglement.

APA, Harvard, Vancouver, ISO, and other styles

47

Safaee, Michael, Andrew T. Parsa, Nicholas M. Barbaro, Dean Chou, Praveen V. Mummaneni, Philip R. Weinstein, Tarik Tihan, and Christopher P. Ames. "Association of tumor location, extent of resection, and neurofibromatosis status with clinical outcomes for 221 spinal nerve sheath tumors." Neurosurgical Focus 39, no. 2 (August 2015): E5. http://dx.doi.org/10.3171/2015.5.focus15183.

Full text

Abstract:

OBJECT Intradural extramedullary spine tumors represent two-thirds of all primary spine neoplasms. Approximately half of these are peripheral nerve sheath tumors, mainly neurofibromas and schwannomas. Given the rarity of this disease and, thus, the limited analyses of clinical outcomes, the authors examined the association of tumor location, extent of resection, and neurofibromatosis (NF) status with clinical outcomes. METHODS Patients were identified through a search of the University of California, San Francisco, neuropathology database and a separate review of current procedural terminology codes. Data recorded included patient age, patient sex, clinical presentation, presence of NF, tumor type, tumor location, extent of resection (gross-total resection [GTR] or subtotal resection [STR]), and clinical follow-up. RESULTS Of 221 tumors in 199 patients (mean age 45 years), 53 were neurofibromas, 163 were schwannomas, and 5 were malignant peripheral nerve sheath tumors. The most common presenting symptom was spinal pain (76%), followed by weakness (36%) and sensory abnormalities (34%). Mean symptom duration was 16 months. In terms of spinal location, neurofibromas were more common in the cervical spine (74% vs 27%, p < 0.001), and schwannomas were more common in the thoracic and lumbosacral spine (73% vs 26%, p < 0.001). Rates of GTR were lower for neurofibromas than schwannomas (51% vs 83%, p < 0.001), regardless of location. Rates of GTR were lower for cervical (54%) than thoracic (90%) and lumbosacral (86%) lesions (p < 0.001). NF was associated with lower rates of GTR among all tumors (43% vs 86%, p < 0.001). The mean follow-up time was 32 months. Recurrence/progression was more common for neurofibromas than schwannomas (17% vs 7%, p = 0.03), although the mean time to recurrence/progression did not differ according to tumor type (45 vs 53 months, p = 0.63). As expected, GTR was associated with lower recurrence rates (4% vs 22%, p < 0.001). According to multivariate analysis, cervical location (OR 0.239, 95% CI 0.110–0.520) and presence of NF (OR 0.166, 95% CI 0.054–0.507) were associated with lower rates of GTR. In a separate model, only GTR (OR 0.141, 95% CI 0.046–0.429) was associated with tumor recurrence. CONCLUSIONS Resection is an effective treatment for spinal nerve sheath tumors. Neurofibromas were found more commonly in the cervical spine than in other regions of the spine and were associated with higher rates of recurrence and lower rates of GTR than other tumor types, particularly in patients with NF Types 1 or 2. According to multivariate analysis, both cervical location and presence of NF were associated with lower rates of GTR. According to a second multivariate model, the only variable associated with tumor recurrence was extent of resection. Maximal safe resection remains ideal for these lesions; however, patients with cervical tumors or NF should be counseled about their increased risk for recurrence.

APA, Harvard, Vancouver, ISO, and other styles

48

Bocharova, I. E., R. Johannesson, B. D. Kudryashov, and P. Stahl. "Tailbiting codes: bounds and search results." IEEE Transactions on Information Theory 48, no. 1 (2002): 137–48. http://dx.doi.org/10.1109/18.971744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

�sterg�rd, Patric R. J. "Constructing covering codes by tabu search." Journal of Combinatorial Designs 5, no. 1 (1997): 71–80. http://dx.doi.org/10.1002/(sici)1520-6610(1997)5:1<71::aid-jcd6>3.0.co;2-v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Liu, Gang, Gui Xin Xuan, and Xia Zhang. "Correlation Property and Low Bound of Time-Hopping Codes for UWB Communications." Applied Mechanics and Materials 743 (March 2015): 545–50. http://dx.doi.org/10.4028/www.scientific.net/amm.743.545.

Full text

Abstract:

In this paper, we analyze correlation property of time-hopping (TH) codes for time-hopping spread spectrum ultra wideband (THSS-UWB) communication systems. Several different definitions of TH periodic correlation function are compared and discussed. Based on the comparison, the relation between TH codes and frequency-hopping (FH) codes is obtained. Also, the averages of TH periodic correlation function values are investigated, and the relations between averages and four parameters of TH codes are introduced. Based on the result, low bound of maximal TH correlation function values is further given, where the expression of low bound of TH codes relates codes period, the number of time slots, TH codes family size and maximal TH correlation function values.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!