Abstract The aim of the present research was to develop a silymarin-laden PVP-nanocontainer providing ameliorated aqueous solubility and dissolution of the drug. Several silymarin-laden formulations were formed with varying quantities of PVP and SDS via the solvent evaporation method using the electrospraying technique. The influence of the hydrophilic carriers on solubility and dissolution was explored. The solid-state characterization was carried out by particle-size analysis, PXRD, DSC, FTIR and SEM. All of the formulations demonstrated better solubility and dissolution than did silymarin plain powder. Both the SDS and PVP had positive effects on solubility and dissolution of silymarin in the aqueous media. An increased solubility was attained as the drug/PVP ratio was 1/4; however, further increase in PVP did not provide significant improvement. In particular, a nanocontainer formulation prepared with silymarin, PVP and SDS (1/4/0.5, w/w/w) exhibited the best solubility (26432.76 ± 1749.00 μg/mL) and an excellent dissolution (~92 % in 20 min) than did silymarin plain powder. Also, it demonstrated similar dissolution profiles compared to a commercial product; therefore, might be bioequivalent to the commercial product (f 1 = 3 and f 2 = 69). Moreover, cumulative undersize distribution values as represented by X10, X50 and X90 were 201 ± 21.01 nm, 488 ± 36.05 nm and 392 ± 48.10 nm, respectively. The drug existed in the amorphous state in the PVP-nanocontainers with no strong chemical bonding with other excipients. Thus, this formulation might be used for more effective administration of silymarin via the oral route.

Para um determinado código binário BCH Cn de comprimento n = 2s−1 gerado por um polinômio de grau r não existe um código BCH binário de comprimento (n + 1)n gerado por um polinômio generalizado de grau 2r. No entanto, não existe um código cíclico binário C(n+1)n de comprimento (n + 1)n de tal modo que o código BCH binário Cn é imerso em C(n+1)n. Assim, um código de taxa elevada é alcançado através de um código cíclico binário C(n+1)n para um código BCH binário Cn. Além disso, propomos um algoritmo que facilita na decodificação de um código BCH binário Cn através da decodificação de um código cíclico binário C(n+1)n, ao passo que os códigos Cn e C(n+1)n possuem a mesma distância de Hamming mínima.

For a given binary BCH code Cn of length n = 2s - 1 generated by a polynomial of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial of degree 2r. However, it does exist a binary cyclic code C(n+1)n of length (n + 1)n such that the binary BCH code Cn is embedded in C(n+1)n. Accordingly a high code rate is attained through a binary cyclic code C(n+1)n for a binary BCH code Cn. Furthermore, an algorithm proposed facilitates in a decoding of a binary BCH code Cn through the decoding of a binary cyclic code C(n+1)n, while the codes Cn and C(n+1)n have the same minimum hamming distance.

Polinômios trigonométricos são amplamente utilizados em diferentes áreas de engenharia e ciências. Inspirado por suas aplicações, investigamos domínios semi-fatorial em anéis de polinômios trigonométricos. Nós construímos o domínios semi-fatoriais T'2, T'3 e T'4 que são os subanéis do anel de complexos, polinômios trigonométricas T', de tal forma que T'2 ⊆ T'3 ⊆ T'4 ⊆ T'. Discutimos, também, entre estes três subanéis a Condição: Seja A ⊂ B ser uma extensão unitária (comutativa) do anel. Para cada x ∈ B existem x ' ∈ U (B) e x" ∈ A tal que x = x ' x ", onde U (B) é o grupo de unidades de B.

Trigonometric polynomials are widely used in different fields of engineering and science. Inspired by their applications, we investigate half-factorial domains in trigonometric polynomial rings. We construct the half-factorial domains T '2, T'3 and T'4 which are the subrings of the ring of complex trigonometric polynomials T , such that T'2 ⊆ T'3 ⊆ T'4 ⊆ T'. We also discuss among these three subrings the Condition: Let A ⊆ B be a unitary (commutative) ring extension. For each x ∈ B there exist x ∈ U (B) and x" ∈ A such that x = x'x", where U (B) denote the group of units of B.