Methods, apparatuses, and systems for encoding information symbols comprising loading information symbols into a data array with n(1) rows and n(2) columns, wherein each column has ki(1) information symbols, and wherein k(1) is an array that has at least two different values, encoding each column with a code Ci(1) from a family of nested codes C(1), wherein C(1) includes two different nested codes, and encoding each row with a code C(2).

The present invention is directed generally to the transmission of signals in communications systems. More particularly, the invention relates to systems, devices, and methods for producing, transmitting, receiving, and decoding forward error corrected signals using multi-dimensional irregular array codes and using the codes to correct errors in signal.
The development of digital technology provided the ability to store and process vast amounts of information. While this development greatly increased information processing capabilities, it was soon recognized that in order to make effective use of information resources it was necessary to interconnect and allow communication between information resources. Efficient access to information resources requires the continued development of information transmission systems to facilitate the sharing of information between resources.
One way to more efficiently transmit large amounts of information is through forward error correction (FEC) coding. FEC coding can result in a processing gain that allows for lower signal power and/or higher data rates while achieving a required data error rate. FEC coding is the addition of redundancy to transmitted data to provide the ability to detect and correct errors that occur during data transmission.
FIG. 1 shows the structure of FEC encoded data using a "product code." A product code may be derived from component codes by arranging the information to be encoded into a two-dimensional array. A component code is assigned to each dimension and applied to all vectors in the assigned dimension. The component codes can be different or the same for each dimension. The encoded information results in an n1×n2 array. Information symbols are loaded into a k1×k2 portion of the n1×n2 array. For example, C1 and C2 are linear block codes with parameters [n1, k1, d1] and [n2, k2, d2] respectively. The information symbols to be encoded by C1 and C2 in this example may be binary data. The first parameter n denotes the code word length or number of coded bits. The second parameter k denotes the dimension of the code and corresponds to the number of information bits to be encoded. The third parameter d denotes the minimum Hamming distance of the code or the minimum number of positions in which two distinct code words must differ. Generally, r=n−k check symbols result from encoding the k information symbols. The two-dimensional product code C1{circle around (×)} C2 is formed by applying C1 to each of the columns and C2 to each of the rows of the k1×k2 rectangular array of information bits as depicted in FIG. 1. Thus, the each code word in C1{circle around (×)} C2 can be represented as an n1×n2 matrix, whose columns are code words in C1 and whose rows are code words in C2. The product code has parameters [n1n2, k1k2, d1d2]. Alternatively, C2 may first be applied to the rows and then C1 to the columns. The order that codes are applied does not matter. In either case the check on checks will be the same because the codes are linear block codes.
Product codes may be decoded in an iterative fashion using decoders corresponding to the component codes. For example, in a two-dimensional product code, one could first apply a hard-decision decoder for C1 to the columns, and then apply a hard-decision decoder for C2 to the rows as corrected by the column-decoding pass. Often, error patterns that were uncorrectable in a given row during the first row-decoding pass become correctable after the column-decoding pass has corrected some errors. Thus, iterating between row-decoding and column-decoding may correct more errors than a single decoding pass. A fixed number of iterations may be performed. Alternatively, iterations may be preformed until some stopping criterion is satisfied, for example, performing iterative decoding until the decoded array passes a cyclic redundancy check. Also, product codes may be decoded using turbo decoding techniques that provide an efficient method of exchanging soft-decision information among component decoders. For more information on turbo decoding see: Pyndia, R. M., Near-Optimum Decoding of Product Codes: Block Turbo Codes, IEEE Tans. on Communications, Vol. 46, No. 8, August 1998, pp. 1003-1010. Because a code may be decoded using various methods, the names used for codes will refer exclusively to their construction and not to a decoding method.
Bose-Chaudhuri-Hocquenghem (BCH) codes are frequently used in the construction of product codes because the class offers a wide choice of block sizes and rates while resulting in efficient decoders. Reed-Solomon codes are non-binary cyclic codes constructed in the analogous fashion over the Galois field GF(2r) and are similarly well-suited for non-binary product code constructions. BCH and Reed-Solomon codes are briefly described below.
A BCH code of natural length n=2r−1 is a binary cyclic code in which the generator polynomial g(x) has binary coefficients and has the elements αb, αb+1, . . . , αb+d−2 in the finite field GF(2r) as roots. Here b and d are design parameters, and α is a primitive in GF(2r). The generator polynomial for this code is:g(x)=LCM(Mb(x),Mb+1(x), . . . ,Mb+d−2(x)).  (1)Mi(x) denotes the minimal polynomial for the element αi. This class of BCH codes is referred to as the class of primitive BCH codes. If b=1, the codes are further classified as narrowsense primitive BCH codes. More generally, we can let α be a non-primitive element in GF(2r) of multiplicative order ord α. In this case, the BCH codes so constructed have natural length n=ord α and are referred to as non-primitive BCH codes. In all cases, the minimum Hamming distance of the BCH code is at least as large as the design parameter d. The maximum guaranteed error correction capability of the code is therefore at least t=[(d−1)/2]. The dimension of the code is k=n−deg g(x).
Reed-Solomon codes are non-binary cyclic codes constructed in the analogous fashion over the Galois field GF(2r) and are similarly well-suited for non-binary product code constructions. The non-binary generator polynomialg(x)=(x+αb)(x+αb+1) . . . (x+αb+d−2)  (2)generates a non-binary Reed-Solomon code of length n=ord α and minimum Hamming distance of exactly d. Usually, α is taken to be primitive so that n=2r−1. The dimension of the code is k=n−deg g(x)=n−d+1.
A cyclic code of length n consists of all polynomials of degree <n that are proper multiples of the generator polynomial g(x). Thus, cyclic codes are nested in the following sense. Let C1, C2, . . . , CL be a family of cyclic codes in which code Ci has generator polynomial gi(x). Then all of the codes Ci are contained in the cyclic code Csup as subcodes, where Csup has generator polynomial:g(x)=GCD(g1(x),g2(x), . . . , gL(x)).  (3)GCD refers to the greatest common divisor. For example, among the narrowsense primitive BCH codes, the code with maximum error-correcting capability t=1 contains the code with maximum error-correcting capability t=2, which contains the code with maximum error-correcting capability t=3, and so forth. This nesting property of the BCH (and Reed-Solomon codes) plays no significant role in product code constructions, but nesting is a useful feature in the irregular array code construction of the present invention.
One problem with product codes is that they do not have a "thin spectrum" in the sense that the number of code words of minimum Hamming weight dmin, weight dmin+1, etc. are small. Product codes do not have a thin spectrum. For example, the product code generated by the single parity check code. The single parity check code has dmin=2, so the product code has dmin=4. All patterns of the following form are code words of weight 4:C(M,N)=C(M,N+n)=C(M+m,N)=C(M+n,N+n)=1,C(i,j)=0 for all other i,j. In fact, any translation or expansion of a valid pattern of 1s (i.e. valid meaning that the result is a codeword) is also a valid pattern. This is due to the regularity of the product code.
Assuming the optimal decoder, the asymptotic high signal to noise ratio performance of a code in an additive white Guassian noise like channel is governed by the minimum Hamming weight and number of code words of minimum Hamming weight. At low SNR, the entire weight spectrum is important, so spectral thinness results in better performance for SNRs near the Shannon limit. Therefore there remains a need for FEC codes that improve performance at lower SNRs found in many applications.

Multi-dimensional irregular array codes and methods for forward error correction, and apparatuses and systems employing such codes and methods


A mobile terminal and a photograph deletion method thereof are disclosed. The method comprises: pre-storing in the mobile terminal a preset touch gesture used for deleting a picture from a photography interface during photography, and mapping the preset touch gesture to a deletion command; receiving a user's touchscreen command to determine whether the user's touch gesture matches the preset touch gesture when the photography interface of the mobile terminal requires deletion of a picture; if yes, determining a deletion target according to action points of the touch gesture; and moving deletion target into a recycling bin. The captured picture is rapidly deleted from the photography interface through a simple touchscreen gesture without exiting the camera application program and with no need to manually switch an operation interface.

With the continuous development of electronic technology and the gradual improvement of the quality of human life, various intelligent mobile terminals, such as smart phones and tablets, are widely used.
Most of the current intelligent devices are equipped with cameras in support of photographing and video recording functions. It is very convenient for users to take pictures and make films at all times and all places by using these intelligent mobile terminals. The captured pictures with which the users are not satisfied can also be instantly deleted. There are two approaches to instantly deleting pictures during photography in existing intelligent mobile terminals. One of the two approaches is based on the Android system 4.0 and older versions. Since the camera application does not have a deletion operation, the user has to exit the camera application and then finishes the picture deletion in other applications such as a gallery application. This interrupts the normal photographing process and is not convenient for the user. The other approach to instantly deleting pictures is based on the Android system 4.1 and higher versions. The user can proceed with picture deletion in the camera application but has to manually switch between different interfaces. Also, the user needs to confirm each deletion, and the operation is thus redundant.
Therefore, the conventional skills still need to be improved upon and developed.

Mobile terminal-based photograph deletion method and mobile terminal

HUIZHOU TCL MOBILE COMMUNICATION CO., LTD.


An air-conditioned seat includes a seat area and a backrest, the seat area and/or the backrest being cushioned with foam. For climate-control, a ventilator, in particular a radial ventilator, is provided, which is in operative connection with an air distribution device in the foam of the seat area and/or the backrest, the air distribution device including an air distribution structure on the side (e.g., a B side) facing away from the seated person, as well as air-conducting channels toward the side (e.g., an A side) facing the seated person. The ventilator is to be disposed in the foam itself, on the B side. The air is transported to the A side via the air distribution structure in the form of air trenches introduced into the foam on the B side, and via the air-conducting channels.

An air-conditioned seat is described in German Published Utility Model No. 202 19 733. In this seat, a ventilator, for example a radial ventilator, is situated below the seat area—at a distance from it. Via a passage region below the seat, air is transported into an air distribution device in the seat cushion, which includes an air distribution structure on the underside of the seat area, air ducts and air outlets on the top side of the seat area.


A fiber optic connector assembly incorporates features that improve structural rigidity and the integrity of transmitted signals. These features also allow the connector assembly to be accessed easily in high density connectivity environments. These features also facilitate a technique for reversing polarity of the connector assembly with little or no risk of twisting the optical fibers and without requiring the housing assembly to be disassembled. The connector assembly is constructed using a small number of parts, thereby maintaining low maintenance costs while yielding a sturdy structure. A puller can be added to the connector assembly to improve access in congested connectivity applications without increasing the size profile. Chamfered front faces afford a degree of alignment tolerance when plugging the connector assembly into an adapter. Features of the connector assembly can be implemented in both a duplexed housing version as well as a paired simplex clipped version.

Many fiber optic systems employ LC fiber optic connectors for termination and connectivity of fiber optic cables. The small form factor of these LC connectors allows a large number of fiber optic cables to be connected in high density arrays, such as those found in fiber optic patch panels used in data centers. Duplexed LC connectors together house two optical fibers each of which is terminated on a respective ferrule that protrude from the front of the duplexed connectors, thereby providing termination and connectivity for a transmit fiber and a receive fiber.
The small form factor of the LC connector—whether used as a single connector ("simplex") or as a duplexed pair—affords a number of advantages, particularly in high density environment. There are, however, a number of functional and perceptual issues inherent in conventional LC connector designs.
For example, when used in congested environments, such as fiber optic patch panels, the minimal spacing between adjacent LC connectors makes it difficult to both insert the LC connector into, and disconnect it from, its corresponding port in an adapter or module disposed in a patch panel.
Also, reversing the polarity in the field of patch cables pre-terminated to duplexed LC connectors can be a cumbersome task, requiring the duplexed LC connector assembly to be disassembled and the terminated ferrules within the assembly to be physically swapped before reassembling the assembly. In addition to requiring mechanical disassembly and reassembly of the duplexed LC connector assembly, polarity reversal of duplexed LC connectors creates a risk of tangling or twisting the optical fibers when the ferrules are swapped, potentially damaging the fibers. Also, in some cases, users cannot easily identify the current polarity configuration for a given patch cable without unplugging and disassembling the connector. Moreover, the small form factor, coupled with the relatively large number of interconnected components that often make up these duplexed LC connectors, gives rise to a perception that these connectors lack sufficient rigidity and durability to withstand repeated connection to, and disconnection from, patch panels or other devices.
The above-described deficiencies of current LC connectors are merely intended to provide an overview of some of the problems of current technology, and are not intended to be exhaustive. Other problems with the state of the art, and corresponding benefits of some of the various non-limiting embodiments described herein, may become further apparent upon review of the following detailed description.


The invention relates to the compounds or its pharmaceutical acceptable polymorphs, solvates, enantiomers, stereoisomers and hydrates thereof. The pharmaceutical compositions comprising an effective amount of compounds of formula I, formula II, formula III, formula IV, formula V, formula VI, formula VII, formula VIII, formula IX or Formula X and, the methods for the treatment of fungal infections may be formulated for oral, buccal, rectal, topical, transdermal, transmucosal, lozenge, spray, intravenous, oral solution, buccal mucosal layer tablet, parenteral administration, syrup, or injection. Such compositions may be used to treatment of fungal infections.

Invasive infection due to Candida species is largely a condition associated with medical progress, and is widely recognized as a major cause of morbidity and mortality in the healthcare environment. There are at least 15 distinct Candida species that cause human disease, but >90% of invasive disease is caused by the 5 most common pathogens, C. albicans, C. glabrata, C. tropicalis, C. parapsilosis, and C. krusei. Each of these organisms has unique virulence potential, antifungal susceptibility, and epidemiology, but taken as a whole, significant infections due to these organisms are generally referred to as invasive candidiasis.
Oropharyngeal candidiasis is the current term used to describe disease of the linings of the oral cavity caused almost always by Candida albicans. Disease caused by Candida species, including oropharyngeal candidiasis, encompasses a broad spectrum, from the trivial to the most life-threatening of infections. Because the fungus is believed to reside in low numbers on mucous membranes in the healthy host, disease is attributable to a reduction in host defenses, and the host response depends in great measure on where lesions arise. For example, in the most common presentation of oropharyngeal candidiasis, pseudomembranous candidiasis, Gram staining of the curd-like lesions on buccal membranes demonstrates a tangle of oral bacteria, proliferating fungus (predominately blastoconidia and pseudohyphae), and polymorphonuclear leukocytes in an eosinophilic background.
Other forms of oropharyngeal candidiasis manifest as glossitis or erythema in the fissures of the mouth or beneath denture plates. Furthermore, changes in environmental factors can prompt the development of adaptive responses in individual microorganisms to new environmental conditions and introduce more pathogenic microorganisms into the microbial community. Non-mutans streptococci and Actinomyces are predominant in the supragingival ecosystem that cause acidification, resulting in both demineralization of tooth surface and introduction of more cariogenic microorganisms, mutans streptococci, to the ecosystem.
Fusobacteria and Prevotella neutralize subgingival environment pH by nitrogenous metabolism and stimulate GCF efflux. The neutral pH and nitrogenous environment increases the proteolytic activity of Prevotella and facilitates the establishment of a more acid-intolerant, but periodontopathogenic bacterium, Porphyromonas gingivalis.
Managing acute pathology of often relies on the addressing underlying pathology and symptoms of the disease. There is currently a need in the art for new compositions to treatment or delay of the onset of fungal infections and its associated complications progression.

Compositions and methods for the treatment of fungal infections