External codes for multiple unicast networks via interference alignment.

We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and fixed. We show that the problem corresponds to an interference alignment problem over a finite field. In this context, we establish an outer bound for the achievable rate region and provide examples of networks where the bound is sharp. We finally give evidence of the crucial role played by the field characteristic in the problem.

Validating ICD-10 Diagnosis Codes for Guillain-Barré Syndrome in Taiwan's National Health Insurance Claims Database.

Purpose: To validate the International Classification of Diseases, 10th Revision (ICD-10) codes for Guillain-Barré syndrome (GBS) in Taiwan's insurance claims database. Methods: We identified adult patients hospitalized at any Chang Gung Memorial Foundation branch hospital between January 1st, 2017, and December 31st, 2022, with ICD-10 code G61.0 in any of the five discharge diagnosis positions, indicating possible Guillain-Barré syndrome. We then validated the possible GBS diagnosis using data from electronic medical records of the identified patients, based on the diagnostic criteria established by the National Institute of Neurological Disorders and Stroke. We determined the positive predictive values (PPV) of various operational definitions, including the position (primary or other) where the code was recorded in the discharge diagnosis, nerve conduction study (NCS) claims, and / or specific GBS treatments. Results: The final validation cohort of 484 patients with ICD-10 code for GBS in the discharge diagnosis was found to include 368 true GBS patients. Identifying inpatients using only the ICD-10 code for GBS in any of the five positions for discharge diagnosis yielded a PPV of 76.0%. With more restrictive definitions (primary diagnosis only, or requiring additional claims for NCS and/or treatments), the PPV tended to increase, but with fewer true GBS patients identified. Using ICD-10 GBS code in the primary diagnosis plus NCS and treatment claims yielded the highest PPV (98.3%); however, 140 (38.0%) of the true GBS patients were missed using this definition. In contrast, using the ICD-10 GBS code in any position, plus claims for NCS, achieved a relatively good PPV (85.8%) with minimal loss of true GBS patients (13, ie, 3.5%). Conclusion: In Taiwan's NHI claims data, identifying true GBS patients using only the ICD-10 code yielded a PPV of 76.0%; however, adding claims for diagnostic procedure and GBS treatment increased the PPV to 98.3%.

Universal dynamical function behind all genetic codes: P-adic attractor dynamical model.

The genetic code is a map which gives the correspondence between codons in DNA and amino acids. In the attractor dynamical model (ADM), genetic codes can be described as the sets of the cyclic attractors of discrete dynamical systems - the iterations of functions acting in the ring of 2-adic integers Z2. This ring arises from representation of nucleotides by binary vectors and hence codons by triples of binary vectors. We construct a Universal Function B such that the dynamical functions for all known genetic codes can be obtained from B by simple transformations on the set of codon cycles - the "Addition" and "Division" operations. ADM can be employed for study of phylogenetic dynamics of genetic codes. One can speculate that the "common ancestor genetic code" was caused by B. We remark that this function has 24 cyclic attractors which distribution coincides with the distribution for the hypothetical pre-LUCA code. This coupling of the Universal Function with the pre-LUCA code assigns the genetic codes evolution perspective to ADM. All genetic codes are generated from B through the special chains of the "Addition" and "Division" operations. The challenging problem is to assign the biological meaning to these mathematical operations.

Laboratory Data as a Potential Source of Bias in Healthcare Artificial Intelligence and Machine Learning Models.

Artificial intelligence (AI) and machine learning (ML) are anticipated to transform the practice of medicine. As one of the largest sources of digital data in healthcare, laboratory results can strongly influence AI and ML algorithms that require large sets of healthcare data for training. Embedded bias introduced into AI and ML models not only has disastrous consequences for quality of care but also may perpetuate and exacerbate health disparities. The lack of test harmonization, which is defined as the ability to produce comparable results and the same interpretation irrespective of the method or instrument platform used to produce the result, may introduce aggregation bias into algorithms with potential adverse outcomes for patients. Limited interoperability of laboratory results at the technical, syntactic, semantic, and organizational levels is a source of embedded bias that limits the accuracy and generalizability of algorithmic models. Population-specific issues, such as inadequate representation in clinical trials and inaccurate race attribution, not only affect the interpretation of laboratory results but also may perpetuate erroneous conclusions based on AI and ML models in the healthcare literature.

Research on time-division multiplexing for error correction and privacy amplification in post-processing of quantum key distribution.

The post-processing of quantum key distribution mainly includes error correction and privacy amplification. The error correction algorithms and privacy amplification methods used in the existing quantum key distribution are completely unrelated. Based on the principle of correspondence between error-correcting codes and hash function families, we proposed the idea of time-division multiplexing for error correction and privacy amplification for the first time. That is to say, through the common error correction algorithms and their corresponding hash function families or the common hash function families and their corresponding error-correcting codes, error correction and privacy amplification can be realized by time-division multiplexing with the same set of devices. In addition, we tested the idea from the perspective of error correction and privacy amplification, respectively. The analysis results show that the existing error correction algorithms and their corresponding hash function families or the common privacy amplification methods and their corresponding error-correcting codes cannot realize time-division multiplexing for error correction and privacy amplification temporarily. However, according to the principle of correspondence between error-correcting codes and hash function families, the idea of time-division multiplexing is possible. Moreover, the research on time-division multiplexing for error correction and privacy amplification has some practical significance. Once the idea of time-division multiplexing is realized, it will further reduce the calculation and storage cost of the post-processing process, reduce the deployment cost of quantum key distribution, and help to remote the practical engineering of quantum key distribution.

On the Exploration of Quantum Polar Stabilizer Codes and Quantum Stabilizer Codes with High Coding Rate.

Inspired by classical polar codes, whose coding rate can asymptotically achieve the Shannon capacity, researchers are trying to find their analogs in the quantum information field, which are called quantum polar codes. However, no one has designed a quantum polar coding scheme that applies to quantum computing yet. There are two intuitions in previous research. The first is that directly converting classical polar coding circuits to quantum ones will produce the polarization phenomenon of a pure quantum channel, which has been proved in our previous work. The second is that based on this quantum polarization phenomenon, one can design a quantum polar coding scheme that applies to quantum computing. There are several previous work following the second intuition, none of which has been verified by experiments. In this paper, we follow the second intuition and propose a more reasonable quantum polar stabilizer code construction algorithm than any previous ones by using the theory of stabilizer codes. Unfortunately, simulation experiments show that even the stabilizer codes obtained from this more reasonable construction algorithm do not work, which implies that the second intuition leads to a dead end. Based on the analysis of why the second intuition does not work, we provide a possible future direction for designing quantum stabilizer codes with a high coding rate by borrowing the idea of classical polar codes. Following this direction, we find a class of quantum stabilizer codes with a coding rate of 0.5, which can correct two of the Pauli errors.

Improved PEG-Based Construction of Analog Fountain Codes.

This paper proposes an improved progressive edge-growth (PEG) construction of analog fountain codes (AFCs). During edge selection, it simultaneously allocates weight coefficients in descending order. Analysis shows that our proposed construction reduces the probability of large weight coefficients involved in harmful short cycles. Simulation results indicate that it has good block error rate (BLER) in short block length regime.

Noise Transfer Approach to GKP Quantum Circuits.

The choice between the Schrödinger and Heisenberg pictures can significantly impact the computational resources needed to solve a problem, even though they are equivalent formulations of quantum mechanics. Here, we present a method for analysing Bosonic quantum circuits based on the Heisenberg picture which allows, under certain conditions, a useful factoring of the evolution into signal and noise contributions, similar way to what can be achieved with classical communication systems. We provide examples which suggest that this approach may be particularly useful in analysing quantum computing systems based on the Gottesman-Kitaev-Preskill (GKP) qubits.

"I Solemnly Swear": A Comparative Study of Codes of Professional Ethics amongst Pharmacists from Culturally Diverse European Countries.

Ethical practice is a universal concern for healthcare professionals, independent of their social, cultural, or religious background. This study aimed to assess and categorise statements published in codes of ethics for pharmacists from three diverse societies within the wider European area. The study followed a qualitative exploratory and triangular design, comparing the leading professional and ethical statements between three geographically apart countries (Portugal, Lithuania, and Turkey) and using the International Pharmaceutical Federation Code of Ethics proposal as a gold standard. Common core values such as honesty, integrity, and professional autonomy were identified across the countries' codes, suggesting that shared recognised core values underpin pharmacists' practice and policies in culturally diverse settings. None of the codes fully correspond to the framework the International Pharmaceutical Federation proposed. The analysis elicited significant inconsistencies between the codes for analogous practice models within the same continent. Further studies are needed to gain a more profound and comprehensive understanding of the underlying reasons for these discrepancies so that ethical weaknesses can be improved and harmonisation towards best-practice principles can benefit patients and healthcare systems.

Evasive Sets, Covering by Subspaces, and Point-Hyperplane Incidences.

Given positive integers k ≤ d and a finite field F , a set S ⊂ F d is (k, c)-subspace evasive if every k-dimensional affine subspace contains at most c elements of S. By a simple averaging argument, the maximum size of a (k, c)-subspace evasive set is at most c | F | d - k . When k and d are fixed, and c is sufficiently large, the matching lower bound Ω ( | F | d - k ) is proved by Dvir and Lovett. We provide an alternative proof of this result using the random algebraic method. We also prove sharp upper bounds on the size of (k, c)-evasive sets in case d is large, extending results of Ben-Aroya and Shinkar. The existence of optimal evasive sets has several interesting consequences in combinatorial geometry. We show that the minimum number of k-dimensional linear hyperplanes needed to cover the grid [ n ] d ⊂ R d is Ω d ( n d ( d - k ) d - 1 ) , which matches the upper bound proved by Balko et al., and settles a problem proposed by Brass et al. Furthermore, we improve the best known lower bound on the maximum number of incidences between points and hyperplanes in R d assuming their incidence graph avoids the complete bipartite graph K c , c for some large constant c = c ( d ) .

Enhancing the Functionalities of Personal Health Record Systems: Empirical Study Based on the HL7 Personal Health Record System Functional Model Release 1.

Background: The increasing demand for personal health record (PHR) systems is driven by individuals' desire to actively manage their health care. However, the limited functionality of current PHR systems has affected users' willingness to adopt them, leading to lower-than-expected usage rates. The HL7 (Health Level Seven) PHR System Functional Model (PHR-S FM) was proposed to address this issue, outlining all possible functionalities in PHR systems. Although the PHR-S FM provides a comprehensive theoretical framework, its practical effectiveness and applicability have not been fully explored. Objective: This study aimed to design and develop a tethered PHR prototype in accordance with the guidelines of the PHR-S FM. It sought to explore the feasibility of applying the PHR-S FM in PHR systems by comparing the prototype with the results of previous research. Methods: The PHR-S FM profile was defined to meet broad clinical data management requirements based on previous research. We designed and developed a PHR prototype as a web application using the Fast Healthcare Interoperability Resources R4 (FHIR) and Logical Observation Identifiers Names and Codes (LOINC) coding system for interoperability and data consistency. We validated the prototype using the Synthea dataset, which provided realistic synthetic medical records. In addition, we compared the results produced by the prototype with those of previous studies to evaluate the feasibility and implementation of the PHR-S FM framework. Results: The PHR prototype was developed based on the PHR-S FM profile. We verified its functionality by demonstrating its ability to synchronize data with the FHIR server, effectively managing and displaying various health data types. Validation using the Synthea dataset confirmed the prototype's accuracy, achieving 100% coverage across 1157 data items. A comparison with the findings of previous studies indicated the feasibility of implementing the PHR-S FM and highlighted areas for future research and improvements. Conclusions: The results of this study offer valuable insights into the potential for practical application and broad adoption of the PHR-S FM in real-world health care settings.

A tradeoff between efficiency and robustness in the hippocampal-neocortical memory network during human and rodent sleep.

Sleep constitutes a brain state of disengagement from the external world that supports memory consolidation and restores cognitive resources. The precise mechanisms how sleep and its varied stages support information processing remain largely unknown. Synaptic scaling models imply that daytime learning accumulates neural information, which is then consolidated and downregulated during sleep. Currently, there is a lack of in-vivo data from humans and rodents that elucidate if, and how, sleep renormalizes information processing capacities. From an information-theoretical perspective, a consolidation process should entail a reduction in neural pattern variability over the course of a night. Here, in a cross-species intracranial study, we identify a tradeoff in the neural population code during sleep where information coding efficiency is higher in the neocortex than in hippocampal archicortex in humans than in rodents as well as during wakefulness compared to sleep. Critically, non-REM sleep selectively reduces information coding efficiency through pattern repetition in the neocortex in both species, indicating a transition to a more robust information coding regime. Conversely, the coding regime in the hippocampus remained consistent from wakefulness to non-REM sleep. These findings suggest that new information could be imprinted to the long-term mnemonic storage in the neocortex through pattern repetition during sleep. Lastly, our results show that task engagement increased coding efficiency, while medically-induced unconsciousness disrupted the population code. In sum, these findings suggest that neural pattern variability could constitute a fundamental principle underlying cognitive engagement and memory formation, while pattern repetition reflects robust coding, possibly underlying the consolidation process.

Accommodating Learners: An Adaptive Approach to Surgical Hand Preparation With Crutches.

PROBLEM: Accommodations for injured and disabled surgical providers have to balance an individual's needs with measures that ensure sterility requirements, patient and provider safety. The highly specialized nature of the surgical environment poses challenges when implementing changes in the operating room and literature is limited on adaptive surgical hand preparation techniques necessary to maximize a disabled medical student's active participation in their surgical clerkship. INTERVENTION: This paper presents a detailed account of the development and implementation of an adaptive surgical hand preparation designed to address mobility needs, enabling a student's active participation and education in the surgical curriculum. This offers a framework for adapting traditional surgical hand preparation techniques for crutches consisting of essential requirements in terms of equipment and personnel, step-by-step guide for implementation, discussion of potential risks related to contamination and safety, and a discussion on future directions for further innovation. CONTEXT: An adaptive surgical hand preparation technique was necessary to sterilize forearm crutches for a third-year medical student with a physical disability to ensure accessibility in the operating room and equity in surgical clerkship and medical education. Successful use of this protocol, in over 40 surgical cases throughout an 8-week surgical clerkship, created opportunity for a disabled medical student to access the sterile operating table through collaboration and innovation in the operating room. IMPACT: The adaptive hand preparation and sterile crutch cover solution was necessary for the student to assist in open, laparoscopic, and surgical procedures resulting in high clinical performance marks in the surgical clerkship. Beyond the individual benefit, this protocol promotes the importance of equity in medication education and encourages diversity through adaptive measures in the surgical field. LESSONS LEARNED: Designing an adaptive sterilization protocol for use of crutches in the operating room serves as an example of educational engineering and adaptable accessibility. The entire collaborative effort involving the medical student, university, surgical providers and operating room staff demonstrates the importance of teamwork in creating access in healthcare settings. Through learned experience, the authors provide insights for future directions for innovation, aiming to enhance access and inclusivity in medical education and surgical practice. This paper reflects on the broader implications of educational engineering and inclusive practices in healthcare.

Trends and Patterns in Obesity-Related Deaths in the US (2010-2020): A Comprehensive Analysis Using Centers for Disease Control and Prevention Wide-Ranging Online Data for Epidemiologic Research (CDC WONDER) Data.

Obesity is a significant public health issue in the United States, contributing to a range of chronic conditions and premature mortality. This study analyzes patterns in obesity-related deaths from 2010 to 2020 using the Centers for Disease Control and Prevention Wide-Ranging Online Data for Epidemiologic Research (CDC WONDER) database to identify trends and demographic disparities. A retrospective analysis was conducted using the CDC WONDER Database, focusing on mortality data associated with specific International Classification of Diseases, Tenth Revision (ICD-10) codes for obesity (E66.0, E66.1, E66.2, E66.8, and E66.9). Data were extracted for the period from January 1, 2010, to December 31, 2020. Mortality rates per 100,000 population were calculated and analyzed across different demographic groups, including age, gender, and race/ethnicity. The analysis revealed an overall increase in obesity-related mortality rates, rising from 1.8 per 100,000 in 2010 to 3.1 per 100,000 in 2020. Age-specific mortality rates showed a significant increase in older age groups, with the highest rates observed in individuals aged 55-64 years (6.4 per 100,000) and 65-74 years (7.2 per 100,000). Gender disparities were evident, with higher mortality rates in males (3.4 per 100,000) compared to females (2.8 per 100,000) by the end of the study period. Racial disparities were also noted, with Black or African American individuals experiencing the highest mortality rates (4.3 per 100,000). The study highlights a concerning upward trend in obesity-related mortality in the United States over the past decade, with notable disparities based on age, gender, and race. These findings underscore the need for targeted public health interventions and policies aimed at reducing obesity prevalence and its associated mortality. Further research should explore the underlying causes and contributing factors to these trends to develop effective strategies for obesity management and prevention. Among the notable strengths of this study include the observation that it leveraged a comprehensive and decade-long countrywide database with detailed and up-to-date ICD-10 codes and demographic data to offer in-depth insights into obesity-related disparities and mortality trends in the United States. Nevertheless, the findings of this study have been limited by its increased focus on the United States' data, depending only on mortality records devoid of consideration of morbidity, alongside the lack of detailed data on lifestyle factors and comorbid conditions.

Benefit-Cost Analysis for Earthquake-Resilient Building Design and Retrofit: State of the Art and Future Research Needs.

This paper reviews the state of the art in using benefit-cost analysis (BCA) to inform earthquake risk reduction decisions by building owners and policymakers. The goal is to provide a roadmap for the application and future development of BCA methods and tools for earthquake risk reduction. Our review covers three earthquake risk reduction measures: adopting up-to-date building codes for new construction, designing new buildings to exceed code requirements, and retrofitting deficient existing buildings. We highlight the factors that influence the cost-effectiveness of building design and retrofit, as well as tactics for increasing the cost-effectiveness of risk reduction strategies. We also present BCA results, methods, and data sources used in the literature to help researchers and practitioners design and conduct a reliable and robust BCA study. In the process, we develop a set of opportunities and challenges for applying BCA to new areas of research, as well as key gaps and limitations in current BCA approaches, including further investigation of above-code design, incorporation of code implementation and enforcement into BCA, quantification of environmental benefits of seismic retrofits, and optimization of seismic retrofits with energy upgrades. Overall, our review provides practical guidance and useful insights into BCA with the goal of increasing the earthquake resilience and economic efficiency of buildings in the United States.

Genetic code, the problem of coding biological cycles, and cyclic Gray codes.

This article is devoted to the problem of genetically coding of inherited cyclic structures in biological bodies, whose life activity is based on a great inherited set of mutually coordinated cyclic processes. The author puts forward and arguments the idea that the genetic coding system is capable of encoding inherited cyclic processes because it itself is a system of cyclic codes connected with Boolean algebra of logic. In other words, the physiological processes in question are cyclical because they are genetically encoded by cyclic codes. In support of this idea, the author presents a set of his results on the connection of the genetic coding system with cyclic Gray codes, which are one of many known types of cyclic codes. This opens up the possibility of using for modeling inherited cyclic biostructures those algebraic and logical theories and constructions that are associated with Gray codes and have long been used in engineering technologies: Karnaugh maps, Hilbert curve, Hadamard matrices, Walsh functions, dyadic analysis, etc. The author believes that when studying the origin, evolution and function of the genetic code, it is necessary to take into account the ability of the genetic system to encode many mutually related cyclic processes.

Reverse Shoulder Arthroplasty for Proximal Humerus Fractures and Reverse Shoulder Arthroplasty for Elective Indications Should Have Separate Current Procedural Terminology (CPT) Codes.

BACKGROUND: Reverse shoulder arthroplasty (RSA) for fracture currently shares a single current procedural terminology (CPT) code with RSA for arthropathy despite potential differences in patient factors, procedural demands, postoperative care and needs, and overall hospital systems' resource utilization. We hypothesize that patients indicated for RSA for fracture will have greater medical complexity, require longer operative duration, have higher complication rates, demonstrate inferior functional outcomes, and require greater healthcare cost expenditures compared to a cohort undergoing RSA for rotator cuff arthropathy. METHODS: 383 RSAs were retrospectively reviewed from January 2011 to December 2020. Demographics, comorbidities, operative time, financial charge and cost data, length of stay (LOS), discharge disposition, and all-cause revisions were assessed. Visual analog scale (VAS) pain score and active range of motion (AROM) were evaluated at 2, 6, and 12 months postoperatively. RESULTS: 197 total RSA were included with 28 for fracture and 169 for arthropathy indications after exclusions. RSA operative time was longer for fractures with an average of 143.2±33.7 minutes compared to 108.2±33.9 minutes for arthropathy (p=0.001). Average cost per patient for RSA for proximal humerus fracture was $2,489 greater than cost for RSA for elective indications; however, no statistically significant difference was noted between average costs (p=0.126). LOS was longer for RSA for fracture compared to arthropathy with a mean of 4.0 ± 3.6 days versus 1.8 ± 2.3 days (p=0.004). The fracture group was 3.6 times more likely to be discharged to a skilled nursing facility or inpatient rehab (32% versus 9%, p=0.002). Early and late all-cause revisions were similar between groups. Differences in postoperative AROM for fracture versus arthropathy were significant for active forward flexion (aFF) at 2 months (95.5±36.7°, 117.0±32.3°) and 6 months (110.9±35.2°, 129.2±28.3°) (p=0.020) as well as active adducted external rotation (aER) at 6 months (20.0±20.9°, 33.1±12.3°) (p=0.007) and at 12 months (23.3±18.1°, 34.5±13.8°) (p=0.012). No difference in VAS pain scores were noted between fracture and arthropathy groups at any time point. DISCUSSION: RSA for fractures versus arthropathy have substantial differences in patient characteristics, surgical complexity, and hospital resource utilization. This is of importance given the currently available CPT code does not differentiate indications for RSA, especially if intending to accurately document surgical care delivered.

Validation of anorexia nervosa and Bulimia nervosa diagnosis coding in Danish hospitals assisted by a natural language processing model.

INTRODUCTION: The Danish Health Care Registers rely on the International Statistical Classification of Diseases and Related Health Problems (ICD)-classification and stand as a widely utilized resource for health epidemiological research. Eating disorders are multifaceted syndromes where two distinctive diagnoses are defined, anorexia nervosa (AN) and bulimia nervosa (BN). However, the validity of the registered diagnoses remains to be verified. Manuel chart review is often the method for validation of diagnosis codes, but there is limited research on how natural language processing (NLP) models could enhance this process. OBJECTIVE: To investigate the accuracy of the clinical use of ICD-10 diagnosis codes F50.0, F50.1, F50.2, and F50.3 in the Danish Health Care Registers, using a manual chart review assisted by NLP. METHOD: From a cohort of all individuals attending hospitals in Region of Southern Denmark with registered electronic health information, we extracted medical information from the electronic health journal on 100 individuals with each of the four diagnosis codes. After extraction, an NLP model with regular expression search patterns identified relevant text passages for manual chart review. RESULTS: Overall, 372 of the 400 diagnosis codes (93%) were correct. A diagnosis code for AN was correct in 90% of instances, 96% for atypical AN, 96% for BN and 90% for an atypical BN diagnosis code. CONCLUSION: We found that the accuracy of a diagnosis code F50.0, F50.1, F50.2, and F50.3 to be high. This confirms that the generally well-documented validity of the Danish health care registers also applies to the eating disorder diagnoses.

Estimation of the Impulse Response of the AWGN Channel with ISI within an Iterative Equalization and Decoding System That Uses LDPC Codes.

In this paper, new schemes have been proposed for the estimation of the additive white Gaussian noise (AWGN) channel with intersymbol interference (ISI) in an iterative equalization and decoding system using low-density parity check (LDPC) codes. This article explores the use of the least squares algorithm in various scenarios. For example, the impulse response of the AWGN channel h was initially estimated using a training sequence. Subsequently, the impulse response was calculated based on the training sequence and then re-estimated once using the sequence estimated from the output of the LDPC decoder. Lastly, the impulse response was calculated based on the training sequence and re-estimated twice using the sequence estimated from the output of the LDPC decoder. Comparisons were made between the performances of the three mentioned situations, with the situation in which a perfect estimate of the impulse response of the channel is assumed. The performance analysis focused on how the bit error rate changes in relation to the signal-to-noise ratio. The BER performance comes close to the scenario of having a perfect estimate of the impulse response when the estimation is performed based on the training sequence and then re-estimated twice from the sequence obtained from the output of the LDPC decoder.

A Communication-Efficient Distributed Matrix Multiplication Scheme with Privacy, Security, and Resiliency.

Secure distributed matrix multiplication (SDMM) schemes are crucial for distributed learning algorithms where extensive data computation is distributed across multiple servers. Inspired by the application of repairing Reed-Solomon (RS) codes in distributed storage and secret sharing, we propose SDMM schemes with reduced communication overhead through the use of trace polynomials. Specifically, these schemes are designed to address three critical concerns: (i) ensuring information-theoretic privacy against collusion among servers; (ii) providing security against Byzantine servers; and (iii) offering resiliency against stragglers to mitigate computing delays. To the best of our knowledge, security and resiliency are being considered for the first time within trace polynomial-based approaches. Furthermore, our schemes offer the advantage of reduced sub-packetization and a lower server-count requirement, which diminish the computational complexity and download cost for the user.